代码随想录算法训练营第55天|● 583. 两个字符串的删除操作 ● 72. 编辑距离 ● 编辑距离总结篇

最新推荐文章于 2024-07-13 13:36:16 发布

Yueqiao13

最新推荐文章于 2024-07-13 13:36:16 发布

阅读量314

点赞数 2

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

本文链接：https://blog.csdn.net/sinat_31325467/article/details/139350997

版权

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

就是两个都要删除，取两个都删的最低操作

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp=[[0]*(len(word2)+1) for _ in range(len(word1)+1)]
        for i in range(len(word1)+1):
            dp[i][0]=i
        for j in range(len(word2)+1):
            dp[0][j]=j
        for i in range(1,len(word1)+1):
            for j in range(1,len(word2)+1):
                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]+2,dp[i-1][j]+1,dp[i][j-1]+1)
        return dp[-1][-1]

72. 编辑距离

增删替--增==对面删删==删替：+1

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp=[[0]*(len(word2)+1) for _ in range(len(word1)+1)]
        for i in range(len(word1)+1):
            dp[i][0]=i
        for j in range(len(word2)+1):
            dp[0][j]=j
        for i in range(1,len(word1)+1):
            for j in range(1,len(word2)+1):
                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-1][j],dp[i][j-1])+1
        return dp[-1][-1]

编辑距离正式结束