动态规划-回文子串
力扣链接
class Solution {
public:
int countSubstrings(string s) {
int result = 0;
vector<vector<bool>> dp(s.size(),vector<bool>(s.size(),false));
for(int i = s.size() - 1; i >= 0; i--){
for(int j = i; j < s.size(); j++){
if(s[i] == s[j]){
if(j - i <= 1){
dp[i][j] = true;
result++;
}else if(dp[i + 1][j - 1]){
dp[i][j] = true;
result++;
}
}
}
}
return result;
}
};
动态规划-最长回文子序列
力扣链接
class Solution {
public:
int longestPalindromeSubseq(string s) {
vector<vector<int>> dp(s.size(),vector<int>(s.size(),0));
for(int i = 0; i < s.size(); i++){
int j = i;
dp[i][j] = 1;
}
for(int i = s.size() - 1; i >= 0; i--){
for(int j = i + 1; j < s.size(); j++){
if(s[i] == s[j]){
dp[i][j] = dp[i + 1][j - 1] + 2;
}else{
dp[i][j] = max(dp[i + 1][j] , dp[i][j - 1]);
}
}
}
return dp[0][s.size() - 1];
}
};