【思路】
【代码】
class Solution:
def minDistance(self, word1: str, word2: str) -> int:
m = len(word1) # 5
n = len(word2) # 3
dp = [[0] * (n+1) for _ in range(m+1)]
# 第一列
for i in range(1, m+1):
dp[i][0] = dp[i-1][0] + 1
# 第一行
for j in range(1, n+1):
dp[0][j] = dp[0][j-1] + 1
for i in range(1, m+1):
for j 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][j-1],
dp[i-1][j],
dp[i-1][j-1]
) + 1
return dp[-1][-1]