LeetCode 72. 编辑距离
题目描述
给你两个单词 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:
n,m = len(word1), len(word2)
dp = [[0]*(m+1) for _ in range(n+1)]
for i in range(m+1):
dp[0][i] = i
for i in range(n+1):
dp[i][0] = i
for i in range(n):
for j in range(m):
if word1[i] == word2[j]:
dp[i+1][j+1] = dp[i][j]
continue
dp[i+1][j+1] = min(dp[i+1][j], dp[i][j+1],dp[i][j]) + 1
return dp[n][m]