leetcode 72. Edit Distance

最新推荐文章于 2020-06-01 04:58:20 发布

明明是我先的

最新推荐文章于 2020-06-01 04:58:20 发布

阅读量143

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/zhuanli555/article/details/80759806

版权

leetcode 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:

a) Insert a character

b) Delete a character

c) Replace a character

class Solution(object):
    def minDistance(self, word1, word2):
        """
        :type word1: str
        :type word2: str
        :rtype: int
        """
        l1, l2 = len(word1)+1, len(word2)+1
        dp = [[0 for _ in xrange(l2)] for _ in xrange(l1)]
        for i in xrange(l1):
            dp[i][0] = i
        for j in xrange(l2):
            dp[0][j] = j
        for i in xrange(1, l1):
            for j in xrange(1, l2):
                dp[i][j] = min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(word1[i-1]!=word2[j-1]))
        return dp[-1][-1]