原题地址:力扣
一看好像没什么思路,但是利用动态规划也能做出来。
f[i,j] = min(通过左上更新的,通过左边更新的,通过右边更新的)
'''
f[i,j]代表word1[0:i+1]转化为word2[0:j+1]所需要的步数
horse,ros
0 1 2 3
1 1 2 3
2 2 1 2
3 2 2 2
4
5
对于左上方 if word1[i] == word2[j]: +0
else: +1
对于上方 +1
对于左方 +1
'''
class Solution:
def minDistance(self, word1: str, word2: str) -> int:
m, n = len(word1), len(word2)
add = 0
f = [[0] * (n + 1) for _ in range(m + 1)] # m行n列
for i in range(n + 1):
f[0][i] = i
for i in range(m + 1):
f[i][0] = i
for i in range(1, m + 1):
for j in range(1, n + 1):
if (word1[i - 1] == word2[j - 1]):
zs = f[i - 1][j - 1]
else:
zs = f[i - 1][j - 1] + 1
z = f[i][j - 1] + 1
s = f[i - 1][j] + 1
f[i][j] = min(zs, z, s)
return f[m][n]