给定两个单词 word1 和 word2,计算出将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
插入一个字符
删除一个字符
替换一个字符
示例 1:
输入: word1 = “horse”, word2 = “ros”
输出: 3
解释:
horse -> rorse (将 ‘h’ 替换为 ‘r’)
rorse -> rose (删除 ‘r’)
rose -> ros (删除 ‘e’)
示例 2:
输入: word1 = “intention”, word2 = “execution”
输出: 5
解释:
intention -> inention (删除 ‘t’)
inention -> enention (将 ‘i’ 替换为 ‘e’)
enention -> exention (将 ‘n’ 替换为 ‘x’)
exention -> exection (将 ‘n’ 替换为 ‘c’)
exection -> execution (插入 ‘u’)
动态规划:
class Solution:
def minDistance(self, word1: str, word2: str) -> int:
a, b = len(word1), len(word2)
if a > b:
return self.minDistance(word2, word1)
dp = [[0]*(b+1) for _ in range(a+1)] # dp[i][j]表示a前i个词和b前j个词的编辑距离
for i in range(a+1):
dp[i][0] = i
for j in range(b+1):
dp[0][j] = j
for i in range(1, a+1):
for j in range(1, b+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-1], dp[i][j-1], dp[i-1][j])
return dp[a][b]