day59|583. 两个字符串的删除操作 ● 72. 编辑距离 ● 编辑距离总结篇-CSDN博客

本文链接：https://blog.csdn.net/qerwtrt4t/article/details/128906812

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

1.代码

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

2.递归五部曲

题意：和上一题不同这一题是两边字符串都要删除，能得到相同字符串的删除方式中最小步数是多少

1.确定dp数组和其下标的含义

由题意可知，dp[i][j]代表以i - 1为结尾的word1和以j - 1为结尾的word2两边进行删除最小步数是多少

2.确定递推公式

dp[i][j]两种方式

当i - 1和j - 1的字符相等时，dp[i][j] = dp[i -1][j - 1]，结果为以i - 2结尾的word1和以j - 2结尾的word2删除步数，因为不必多删

当不相同时，上一个状态就是dp[i - 1][j]和dp[i][j - 1]，需要多删除一个所以结果是在其中求最小值

                if (word1[i - 1] == word2[j - 1]) f[i][j] = f[i - 1][j - 1];
                else f[i][j] = min(f[i][j - 1] + 1, f[i - 1][j] + 1);

3.初始化

由推理方向可知初始化哪些

dp[0][i]代表删除i个就能相等

dp[j][0]代表删除j个就能相等

4.确定遍历顺序，遍历两个字符串的所有情况（范围）

5.模拟

72. 编辑距离

1.代码

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