Leetocde516. 最长回文子序列 动态规划

原题链接：Leetocde516. 最长回文子序列

class Solution {
public:int longestPalindromeSubseq(string s) {int n = s.size();vector<vector<int>> dp(n, vector<int>(n, 1));for (int i = 0; i < n; i++) {dp[i][i] = 1;if (i + 1 < n && s[i] == s[i + 1]) {dp[i][i + 1] = 2;}}for (int l = 3; l <= n; l++) {for (int i = 0; i < n - l + 1; i++) {int j = i + l - 1;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][n - 1];}
};