LeetCode *1143. 最长公共子序列（动态规划）

if (str1[i] == str2[j]) {
    dp[i][j] = dp[i - 1][j - 1] + 1;
}

if (str1[i] != str2[j]) {
    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}

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