代码随想录打卡第55天

最新推荐文章于 2024-07-14 11:23:58 发布

装代码的口袋

最新推荐文章于 2024-07-14 11:23:58 发布

阅读量111

点赞数

文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/qq_43216763/article/details/129440252

版权

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

class Solution {
public:
    int minDistance(string word1, string word2) {
        // if(word1==word2) return 0;
        vector<vector<int>> dp(word1.size()+1,vector<int>(word2.size()+1,0));
        dp[0][0]=0;
        for(int i=1;i<=word1.size();i++)
        {
            dp[i][0]=i;
        }
        for(int i=1;i<=word2.size();i++)
        {
            dp[0][i]=i;
        }
        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]+1,dp[i][j-1]+1);
            }
        }
        return dp[word1.size()][word2.size()];

    }
};

72. 编辑距离

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

    }
};