作者:浪漫族屋nr | 来源:互联网 | 2023-09-24 16:06
GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
class Solution {
public:
string longestPalindrome(string s) {
}
};
[leetcode] 5.Longest Palindromic Substring