[LeetCode] 72. Edit Distance

题目内容

https://leetcode-cn.com/problems/edit-distance/

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

1. Insert a character
2. Delete a character
3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation: 
intention -> inention (remove 't')
inention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')

给定两个单词 word1 和 word2，计算出将 word1 转换成 word2 所使用的最少操作数 。

你可以对一个单词进行如下三种操作：

1. 插入一个字符
2. 删除一个字符
3. 替换一个字符

---

题目思路

依旧是一道动态规划题目。建立一个矩阵dp,，高为wrd1长度，宽为wrd2长度。其中dp[i][j]表示的是wrd1[i]变成wrd2[j]所需要的最少步骤。最后输出矩阵最后一个元素即可。对于wrd[i]变wrd[j]来说，可以考量wrd1[i-1]变wrd2[j](然后wrd1+元素),wrd1[i]变wrd2[j-1](然后wrd1减去一个元素),wrd1[i-1]变wrd2[j-1](之后wrd1替换一个元素即可)。如果新添加的字母两个单词都一样，那么久不需要改变。数值为dp[i-1][j-1]

---

程序代码

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