365天挑战LeetCode1000题——Day 021 动态规划 19

---

392. 判断子序列（118）

代码实现（首刷自解）

class Solution {
public:
    bool isSubsequence(string s, string t) {
        int i = 0;
        int j = 0;
        int n = t.size();
        while (j < t.size()) {
            if (i == s.size()) return true;
            if (s[i] == t[j++]) i++;
        }
        if (i == s.size()) return true;
        return false;
    }
};

72. 编辑距离（119）

代码实现（首刷自解）

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