题解 | #计算字符串的编辑距离#labuladong 写法

def mindistance1(word1, word2):
m = len(word1)
n = len(word2)
dp = [[0 for col in range(n + 1)] for row in range(m + 1)]
for i in range(m + 1):
    dp[i][0] = i
for j in range(n + 1):
    dp[0][j] = j
for i in range(1, m + 1):
    for j in range(1, n + 1):
        dp[i][j] = min(dp[i - 1][j - 1] + (0 if word1[i - 1] == word2[j - 1] else 1), dp[i][j - 1] + 1,
                       dp[i - 1][j] + 1)
print(dp[m][n])             
word1 = input().strip()
word2 = input().strip()
mindistance1(word1, word2)