代码随想录算法训练营33期第五十六天 | 583. 两个字符串的删除操作、72.编辑距离

最新推荐文章于 2024-05-28 20:47:24 发布

Caro Rye

最新推荐文章于 2024-05-28 20:47:24 发布

阅读量11

点赞数 2

文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_43936887/article/details/138376334

版权

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

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

// dp[i][j] 使word1[0:i-1] word2[0:i-2]相等使用的最少操作数
// if word[i-1]==word[j-1]  dp[i][j]=dp[i-1][j-1] 如果下一个元素相等就说明不用增加操作仍然能保持二者相等
// else dp[i][j]=mix(dp[i-1][j]+1, min(dp[i][j-1]+1, dp[i-1][j-1]+1)) 前二者是增删，dp[i-1][j-1]+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=0; i<word1.size()+1; i++) dp[i][0]=i;
        for (int j=0; j<word2.size()+1; j++) dp[0][j]=j;

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