下定决心,好好过一天 ~
题目传送
思路:动态转移方程:i到j为回文的话,那么 dp[i][j] 成立的条件就是 dp[i+1][j-1] 成立,就是说他如果是回文,那么他的中间也必定是回文。再处理一下边界和初始化,从每个位置枚举长度,递推即可
class Solution {
public:
string longestPalindrome(string s) {
int len = s.size();
bool dp[1005][1005] = {0};
for(int i = 0;i < len;i++)
dp[i][i] = 1;
int Begin = 0,Max = 1;
for(int k = 2;k <= len;k++)
{
for(int i = 0;i < len;i++)
{
int j = i+k-1;
// cout << i << " " << j << " " << s[i] << ' ' << s[j] << ' ' << dp[i][j] << endl;
if(j < len && s[i] == s[j])
{
// cout << 1 << endl;
if(k <= 2)
{
dp[i][j] = 1;
if(k > Max)
{
Max = k;
Begin = i;
}
}
else if(k > 2 && dp[i+1][j-1])
{
dp[i][j] = 1;
if(k > Max)
{
Max = k;
Begin = i;
}
}
}
}
}
return s.substr(Begin,Max);
}
};