题目
代码(8.26 首刷看解析)
注意区分这题和Leetcode 516. 最长回文子序列的区别。
class Solution {
public:
string longestPalindrome(string s) {
int n = s.size();
vector<vector<int>> dp(n, vector<int>(n));
for(int i = 0; i < n; i++)
dp[i][i] = 1;
int len = 1, index = 0;
for(int i = n-2; i >= 0; i--) {
for(int j = i+1; j < n; j++) {
if(s[i] == s[j]) {
if(i+1 == j) {
dp[i][j] = 2;
} else if(dp[i+1][j-1] != 0) { // 前面的是回文串,才能进行相加
dp[i][j] = dp[i+1][j-1] + 2;
}
}
if(len < dp[i][j]) {
len = dp[i][j];
index = i;
}
}
}
return s.substr(index, len);
}
};
代码(9.5 二刷看解析)
class Solution {
public:
string longestPalindrome(string s) {
int n = s.size();
vector<vector<int>> dp(n, vector<int>(n));
for(int i = 0; i < n; i++)
dp[i][i] = 1;
int index = 0, len = 1;
for(int i = n-2; i >= 0; i--) {
for(int j = i+1; j < n; j++) {
if(s[i] == s[j]) {
if(i+1 == j) {
dp[i][j] = 2;
} else if(dp[i+1][j-1] != 0) {
dp[i][j] = dp[i+1][j-1] + 2;
}
if(len < dp[i][j]) {
len = dp[i][j];
index = i;
}
}
}
}
return s.substr(index, len);
}
};