【代码随想录】day57

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

一、647回文子串

class Solution {
public:
    int countSubstrings(string s) {
        vector<vector<bool>> dp(s.size(), vector<bool>(s.size(), false));
        int result = 0;
        for (int i = 0; i < s.size(); i ++) {
            dp[i][i] = true;
        }
        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] == true) {
                        dp[i][j] = true;
                        result ++;
                    }
                }
            }
        }
        return result;
    }
};

二、516最长回文子序列

class Solution {
public:
    int longestPalindromeSubseq(string s) {
        int n = s.size();
        vector<vector<int>> dp(n, vector<int>(n, 0));
        for (int i = 0; i < n; i ++) {
            dp[i][i] = 1;
        }
        for (int i = n - 1; i >= 0; i --) {
            for (int j = i + 1; j < n; j ++) {
                if (s[i] == s[j]) {
                    dp[i][j] = dp[i+1][j-1] + 2;
                }
                else {
                    dp[i][j] = max(dp[i][j-1], dp[i+1][j]);
                }
            }
        }
        return dp[0][n-1];
    }
};