首页 > 代码库 > Edit Distance @Leetcode -- Python
Edit Distance @Leetcode -- Python
http://oj.leetcode.com/problems/edit-distance/
class Solution: # @return an integer def minDistance(self, word1, word2): len1 = len(word1) len2 = len(word2) dp = [[0 for j in xrange(len2+1)] for i in xrange(len1 +1)] for i in xrange(len1+1): dp[i][0] = i for j in xrange(len2+1): dp[0][j] = j for i in xrange(1, len1+1): for j in xrange(1, len2+1): if word1[i-1] == word2[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 return dp[len1][len2]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。