题目要求:
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) {
int max_len = 0;
if(s.size() == 0)
return 0;
int idx1, idx2;
for(size_t i = 0; i < s.size(); ++i)
{
size_t j = 0;
for(j = 0; (i - j) >= 0&& (i + j) < s.size(); ++j)
{
if(s[i - j] != s[i + j])
break;
}
if((2 * j + 1) > max_len)
{
idx1 = i - j + 1;
idx2 = i + j - 1;
max_len = 2 * j + 1;
}
for(j = 0; (i - j) >= 0 && (i + j + 1) < s.size(); ++j)
{
if(s[i - j] != s[i + j + 1])
break;
}
if((2 * j + 2) > max_len)
{
idx1 = i - j + 1;
idx2 = i + j;
max_len = 2 * j + 2;
}
}
return s.substr(idx1, idx2 - idx1 + 1);
}
};