Leetcode72. 编辑距离 hot100-代码随想录-面试必考精华版

题目：

---

代码(首刷自解)：

class Solution {
public:
    int minDistance(string word1, string word2) {
        int m = word1.size();
        int n = word2.size();
        // 1.初始化,dp[i][j]代表word1[0:i]和word2[0:j]的最少操作数
        // 设置dp数组时,考虑其中一个word为空的情况,并以word1和word2为空的情况进行初始化
        vector<vector<int>> dp(m+1,vector<int>(n+1,0));
        for(int i = 0 ; i < m+1; ++i) dp[i][0] = i;
        for(int j = 0 ; j < n+1; ++j) dp[0][j] = j;
        // 2.递推方向,从左到右,从上到下
        for(int i = 1 ; i < m+1; ++i){
            for(int j = 1 ; j < n+1; ++j){
                // 3.递推公式:通过总结规律获得
                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 - 1][j], dp[i][j - 1])) + 1;
                }
            }
        }
        return dp[m][n];
    }
};

代码（二刷自解 2024年2月29日）

        还是画图推出来的，额。而且最后返回值写成dp[m - 1][n - 1]我一直发现，最后GPT找的，但代码主体是自己写的，勉强算自解吧。下次再写不能用画图总结规律了。不然遇上ACM模式直接G

class Solution {
public:
    int minDistance(string word1, string word2) {
        int m = word1.size();
        int n = word2.size();
        //if(n == 0) return m;
        //dp + 初始化 dp[i][j] 
        vector<vector<int>> dp(m + 1,vector<int>(n + 1, 0));
        for (int i = 0; i <= m; ++i) dp[i][0] = i;
        for (int j = 0; j <= n; ++j) dp[0][j] = j;
        // 遍历 + 递推公式 
        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= n; ++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], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;
            }
        }
        return dp[m][n];
    }
};

---

代码（三刷自解 debug看了下解析 2024年3月11日）

        又忘了对比text1和text2要下标-1

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; 

        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= n; ++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], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;
                }
            }
        }
        return dp[m][n];
    }
};