代码随想录算法训练营第56天｜583 72 编辑距离总结

583 我想的是直接求两个word的最长公共字符 最后剪掉多余的就return

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(); i++) {
            for (int j=1; j<=word2.size(); j++) {
                if (word1[i-1]==word2[j-1]) dp[i][j]=dp[i-1][j-1]+1;
                else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
        return word1.size()+word2.size()-2*dp[word1.size()][word2.size()];
    }
};

学习了一下代码随想录的另外一种思路 dp表示的是到i-1和j-1的两个word相等要删除的最少字符数

递推公式稍微难想一点

当 word1[i-1]与word2[j-1] 相等的时候 dp[i][j]=dp[i-1][j-1]

不等时要考虑删除哪一个 如果删除 word1[i-1] 那就是 dp[i-1][j]+1 如果删除 word2[j-1] 就是 dp[i][j-1]+1 如果都删除就是dp[i-1][j-1]+2（这个情况肯定不会比前两个小）

初始化所有dp[i][0]和dp[0][j]为i或j

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=0; i<=word1.size(); i++) dp[i][0]=i;
        for (int j=1; j<=word2.size(); j++) dp[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]) dp[i][j]=dp[i-1][j-1];
                else dp[i][j]=min(dp[i-1][j],dp[i][j-1])+1;
            }
        }
        return dp[word1.size()][word2.size()];
    }
};

72 搞懂思路 写起来挺简单的

dp[i][j]表示的是到i-1和j-1的所需的最少操作数 如果相等即这一步不用操作 直接等于dp[i-1][j-1]

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(); i++) dp[i][0]=i;
        for (int j=1; j<=word2.size(); j++) dp[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]) dp[i][j]=dp[i-1][j-1];
                else {
                    dp[i][j] = min({dp[i][j-1], dp[i-1][j], dp[i-1][j-1]})+1;
                }
            }
        }
        return dp[word1.size()][word2.size()];
    }
};