【python】字符串最小变换次数

题目链接：https://www.nowcoder.com/practice/2561ad26e8804cf8801926f03708ef03

注意：dp的初始化！！考虑【ello】和【hello】的特殊情况

s1 = input()
s2 = input()

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