leetcode（72）—字符串编辑距离

leetcode – 72. Edit Distance 原题

动态规划

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:

        m = len(word1)
        n = len(word2)

        dp = [[0 for _ in range(n + 1)] for _ in range(m + 1)]

        for i in range(m + 1):
            dp[i][0] = i

        for j in range(n + 1):
            dp[0][j] = j

        for i in range(1, m + 1):
            for j in range(1, n + 1):
                if word1[i - 1] == word2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1]
                else:
                    dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1],
                                       dp[i - 1][j - 1])  # min of delete, insert of replace operation

        print(dp)
        return dp[-1][-1]
    
x = Solution()
# 访问类的属性和方法
a = 'abandon'
b = 'abanded'
print("MyClass 类的方法 f 输出为：", x.minDistance(a,b))

输出：

[[0, 1, 2, 3, 4, 5, 6, 7], 
 [1, 0, 1, 2, 3, 4, 5, 6], 
 [2, 1, 0, 1, 2, 3, 4, 5], 
 [3, 2, 1, 0, 1, 2, 3, 4], 
 [4, 3, 2, 1, 0, 1, 2, 3], 
 [5, 4, 3, 2, 1, 0, 1, 2], 
 [6, 5, 4, 3, 2, 1, 1, 2], 
 [7, 6, 5, 4, 3, 2, 2, 2]]
MyClass 类的方法 f 输出为： 2