题目:
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.
Tags String
Similar Problems (H) Shortest Palindrome (E) Palindrome Permutation
分析:
(1)遍历:遍历字符串s,将s[i]和s[i,i+1]作为回文子串的中心。
(2)初始化:以当前回文中心作为初始子串s[i,j]。
(3)循环:判断子串s[i,j]两边的字符是否相等,相等则将子串向左右各延伸一位,得到新的回文子串s[i-1,j+1],循环执行,直到回文子串两边的字符不相等时停止,记录长度len。
(4)比较:将当前len和已经得到的maxLen做比较,若len>maxLen,则存储当前子串并修改maxLen=len。
参考资料:最长回文字符串
代码:
//假设存在唯一一个最长回文
class Solution {
public:
string longestPalindrome(string s) {
int size = s.size();
if (size==0)
return NULL;
int maxLen = 0;
int tagLeft=0,tagRight=0;
for(int i = 0;i<size;++i)
{
//奇回文子串
int len = 1;
int left = i;
int right = i;
while(left-1>=0 && right+1<size)
{
if(s[left-1]==s[right+1])
{
len +=2;
--left;
++right;
}
else
break;
}
if(len>maxLen)
{
maxLen = len;
tagLeft = left;
tagRight = right;
}
//偶回文子串
len = 0;
left = i;
right = i-1;//最初符合要求的子串为空
while(left-1>=0 && right+1<size)
{
if(s[left-1]==s[right+1])
{
len +=2;
--left;
++right;
}
else
break;
}
if(len>maxLen)
{
maxLen = len;
tagLeft = left;
tagRight = right;
}
}
string longestPalindrome = s.substr(tagLeft, maxLen);
return longestPalindrome;
}
};