Day.39 | 115.不同的子序列 583.两个字符串的删除操作 72.编辑距离

115.不同的子序列

要点：当 s[i - 1] == t[j - 1] 的时候，即 "bagg" 和 "bag" 中，"bag" 和 "ba" 的匹配个数和 "bag" 和 "bag" 的匹配个数相加；当 s[i - 1] != t[j - 1] 的时候，就是直接取上一位的匹配结果，"bag" 和 "ba"，与 "ba" 和 "ba" 的匹配结果是一样的

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

583.两个字符串的删除操作

要点：当 word1[i - 1] == word2[j - 1] 的时候，就不需要删除，继承 dp[i-1][j-1] 的结果；当 word1[i - 1] != word2[j - 1] 的时候，要么 word1 删一步，要么 word2 删一步

class Solution {
public:
    int minDistance(string word1, string word2) {
        vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1));
        for (int i = 0; i <= word1.size(); ++i)
            dp[i][0] = i;
        for (int i = 0; i <= word2.size(); ++i)
            dp[0][i] = i;
        for (int i = 1; i <= word1.size(); ++i) {
            for (int j = 1; j <= word2.size(); ++j) {
                if (word1[i - 1] == word2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
                }
            }
        }
        return dp[word1.size()][word2.size()];
    }
};

72.编辑距离

要点：当 word1[i - 1] == word2[j - 1] 的时候，就不需要删除，继承 dp[i-1][j-1] 的结果；当 word1[i - 1] != word2[j - 1] 的时候，要么 word1 删一步，要么 word2 删一步，要么 word1 或者 word2 中的元素替换一个

class Solution {
public:
    int minDistance(string word1, string word2) {
        vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1));
        for (int i = 0; i <= word1.size(); ++i)
            dp[i][0] = i;
        for (int i = 0; i <= word2.size(); ++i)
            dp[0][i] = i;
        for (int i = 1; i <= word1.size(); ++i) {
            for (int j = 1; j <= word2.size(); ++j) {
                if (word1[i - 1] == word2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = min(dp[i - 1][j] + 1,
                                   min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1));
                }
            }
        }
        return dp[word1.size()][word2.size()];
    }
};