题目描述:
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.
解题思路:用动态规划的方法。用isPal[i][j]来表示字符串从i到j是否为回文字串。当S[i]=S[j]时,isPal[i][j]=isPal[i+1][j-1],如果此时字串的长度大于 记录的最大长度,则更新最大长度,且记录下回文字串的位置。当S[i]!=S[j]时,isPal[i][j] = false。动态规划的过程从字串长度为1一直到字串长度为n,结束后就得到了最长回文字串。
代码:
string Solution::longestPalindrome(string s)
{
if(s.length() == 0 || s.length() == 1)
return s;
int length = s.length();
int max_length = 1;
int left,right;
bool isPal[1000][1000];
for(int i = 0;i < length;i++)
for(int j = 0;j < length;j++)
{
if(i >= j)
isPal[i][j] = true;
else
isPal[i][j] = false;
}
for(int i = 1;i < length;i++)
for(int j = 0; (i+j) < length;j++)
{
int k = i+j;
if(s[j] != s[k])
isPal[j][k] = false;
else
{
isPal[j][k] = isPal[j+1][k-1];
if(isPal[j][k])
{
if(i+1 > max_length)
{
max_length = i+1;
left = j;
right = i+1;
}
}
}
}
return s.substr(left,right);
}