leetcode 72. 编辑距离

求两个单词之间的编辑距离.

两个单词之间的编辑距离的定义为将 word1 通过 插入， 删除， 替换 字母操作变成 word2 所需要的最小操作次数.
令dp[i][j]表示 word1[0 : i] 和 word2[0 : j] 的编辑距离

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        n, m = len(word1), len(word2)
        dp = [[0] * (m + 1) for _ in range(n + 1)]

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

        for i in range(1, n + 1):
            dp[i][0] = dp[i - 1][0] + 1
        
        for i in range(1, n + 1):
            for j in range(1, m + 1):
                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[-1][-1]