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

import sys

m = input()
n = input()
if len(m) == 0:
    print(len(n))
elif len(n) == 0:
    print(len(m))
else:
    dp = [[0 for _ in range(len(n)+1)] for _ in range(len(m)+1)]

    for i in range(1,len(m)+1):
        dp[i][0] = i
        for j in range(1,len(n)+1):
            dp[0][j] = j
            if m[i-1] == n[j-1]:
                dp[i][j] = min(dp[i-1][j-1],dp[i][j-1]+1,dp[i-1][j]+1)
            else:
                dp[i][j] = min(dp[i-1][j-1]+1,dp[i][j-1]+1,dp[i-1][j]+1)
    print(dp[len(m)][len(n)])