动态规划即可,注意外层循环变量是字串长度len.
class Solution {
public:
string longestPalindrome(string s) {
int n = s.size();
int dp[1005][1005];
memset(dp, 0, sizeof(dp));
int ans = 0, l = 0;
for(int i = 0; i < n; i++) dp[i][i] = 1;
for(int i = 0; i < n-1; i++){
if(s[i] == s[i+1]) dp[i][i+1] = 1;
else dp[i][i+1] = 0;
}
for(int len = 3; len <= n; len++){
for(int i = 0; i+len <= n; i++){
if(s[i] == s[i+len-1]) dp[i][i+len-1] = dp[i+1][i+len-2];
else dp[i][i+len-1] = 0;
}
}
for(int i = 0; i < n; i++)
for(int j = i+1; j < n; j++){
if(dp[i][j] && j-i > ans){
l = i;
ans = j-i;
}
}
string a = s.substr(l, ans+1);
return a;
}
};