LeetCode-72、编辑距离-困难

LeetCode-72、编辑距离-困难

给定两个单词 word1 和 word2，计算出将 word1 转换成 word2 所使用的最少操作数 。

你可以对一个单词进行如下三种操作：

插入一个字符
删除一个字符
替换一个字符
 

示例 1:

输入: word1 = "horse", word2 = "ros"
输出: 3
解释: 
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')

示例 2:

输入: word1 = "intention", word2 = "execution"
输出: 5
解释: 
intention -> inention (删除 't')
inention -> enention (将 'i' 替换为 'e')
enention -> exention (将 'n' 替换为 'x')
exention -> exection (将 'n' 替换为 'c')
exection -> execution (插入 'u')

 

代码1：动态规划，O(n^2)存储

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        len1 = len(word1)
        len2 = len(word2)
        dp = [[0 for j in range(len2+1)] for i in range(len1+1)]
        for j in range(1, len2+1):
            dp[0][j] = j
        for i in range(1, len1+1):
            dp[i][0] = i
        
        for i in range(1, len1+1):
            for j in range(1, len2+1):
                if word1[i-1] == word2[j-1]:
                    dp[i][j] = dp[i-1][j-1]
                else:
                    dp[i][j] = 1 + min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])
        
        return dp[len1][len2]

 

代码2：动态规划优化存储，O(n)存储

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        len1 = len(word1)
        len2 = len(word2)
        dp = [0 for j in range(len2+1)]
        for j in range(1, len2+1):
            dp[j] = j
        
        for i in range(1, len1+1):
            olddpj = dp[0]
            dp[0] = i
            for j in range(1, len2+1):
                olddp, olddpj = olddpj, dp[j]
                if word1[i-1] == word2[j-1]:
                    dp[j] = olddp
                else:
                    dp[j] = 1 + min(dp[j], dp[j-1], olddp)
        
        return dp[len2]