【代码随想录】day56

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

---

一、583两个字符串的删除操作

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

状态压缩：

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

还可以通过求最长公共子序列来求。

二、72. 编辑距离

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

状态压缩：

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