leetcode 516. Longest Palindromic Subsequence

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

需要注意的是，下面这个做法是错误的：

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 j = 0; j < i; j++){
                if(s[i] == s[j]){
                    if(i - j > 1)
                        dp[j][i] = dp[j+1][i-1] + 2;
                    else
                        dp[j][i] = 2;
                }
                else
                    dp[j][i] = max(dp[j+1][i], dp[j][i-1]);
            }
        }
        
        return dp[0][n-1];
        
    }
};

举个例子，对于addc这个字符串，上述代码的过程是dp[0][3] = max(dp[1][3], dp[0][2])，dp[1][3]最终确实是2,但是将2赋给dp[1][3]的过程却在dp[0][3] = max(dp[1][3], dp[0][2])之后，这导致dp[0][3]最终的值为1而不是2.