https://leetcode.com/problems/edit-distance/
这里dp[i,j], i 和 j要看成个数,不要看成index。所以dp[i,j]的意思就是word1的前i个字母,与word2前j个字母的edit distance。这里跟最长公共子序列的思路一样。
对于dp[i,j],这里只需要依靠dp[i,j-1]加上一字母,或者dp[i-1, j]加上一个字母,又或者是d[i-1, j-1] + 1,当word1[i] != word2[j]时,dp[i-1, j-1]当word1[i] == word2[j]。
即。
dp[i][j-1] + 1, 对应j的delete操作
dp[i-1][j] + 1,对应i的delete操作
dp[i-1][j-1] + (0 if word1[i] != word2[j] else 1, 对应replace或者不replace操作
从三种操作出发就可以,这里不考虑insert操作
dp[i,j] = min(dp[i][j-1] + 1, dp[i-1][j] + 1, dp[i-1][j-1] + (0 if word1[i] == word2[j] else 1))
参考http://www.cnblogs.com/zuoyuan/p/3773134.html
http://zhangbuhuai.com/2015/05/23/edit-distance/#
class Solution:
# @return an integer
def minDistance(self, word1, word2):
m=len(word1)+1; n=len(word2)+1
dp = [[0 for i in range(n)] for j in range(m)]
for i in range(n):
dp[0][i]=i
for i in range(m):
dp[i][0]=i
for i in range(1,m):
for j in range(1,n):
dp[i][j]=min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(0 if word1[i-1]==word2[j-1] else 1))
return dp[m-1][n-1]