题目
分析
经典的dp题。
当word[i]==word[j]时,沿用没有i,j两个字符时的最小编辑距离。
当word[i]!=word[j]时,从插入dp[i-1][j]+1,替换dp[i-1][j-1]+1,删除dp[i][j-1]+1中选择一个最小距离。
python代码
class Solution(object):
def minDistance(self, word1, word2):
"""
:type word1: str
:type word2: str
:rtype: int
"""
n = len(word1)
m = len(word2)
dp = [[0]*(m+1) for i in range(n+1)]
for i in range(n+1):
dp[i][0] = i
for i in range(m+1):
dp[0][i] = i
for j in range(1,m+1):
for i in range(1,n+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-1][j-1],dp[i][j-1])+1
return dp[-1][-1]