72. 编辑距离 - 力扣(LeetCode) (leetcode-cn.com)
时间复杂度:O(mn)
空间复杂度:O(mn)
动态规划法:
class Solution(object):
def minDistance(self, word1, word2):
"""
:type word1: str
:type word2: str
:rtype: int
"""
dp=[[0]*(len(word2)+1) for _ in range(len(word1)+1)]
dp[0][0]=0
for i in range(1,len(word1)+1):
dp[i][0]=i
for j in range(1,len(word2)+1):
dp[0][j]=j
for i in range(1,len(word1)+1):
for j in range(1,len(word2)+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]+1,dp[i-1][j]+1,dp[i-1][j-1]+1)
return dp[len(word1)][len(word2)]