【Leetcode】72.編輯距離

KoreyLee 發(fā)布于2019-07-30 17:53 / 3101人閱讀

摘要：題目給定兩個(gè)單詞和，計(jì)算出將轉(zhuǎn)換成所使用的最少操作數(shù)。這個(gè)題目比較為主要是，狀態(tài)轉(zhuǎn)換比較復(fù)雜。

題目

給定兩個(gè)單詞 word1 和 word2，計(jì)算出將 word1 轉(zhuǎn)換成 word2 所使用的最少操作數(shù) 。
你可以對(duì)一個(gè)單詞進(jìn)行如下三種操作：

插入一個(gè)字符
刪除一個(gè)字符
替換一個(gè)字符

示例 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")

題解

這個(gè)題目拿到題目基本就能想到DP，因?yàn)楦杏X(jué)和我們之前的爬樓梯啥的比較相似。這個(gè)題目比較為hard主要是，狀態(tài)轉(zhuǎn)換比較復(fù)雜。

定義: dpi ， word1這個(gè)字符串的前i個(gè) -> word1這個(gè)字符串的前j 個(gè)字符，所需要的最小的步數(shù)

那么有以下幾種情況

word1[i] == word2[j]

不需要做變化，那么 dpi = dp[i-1,j-1]

word1[i] != word2[j]

我們就需要?jiǎng)佑蒙厦婺侨N操作了：

add = dp[i, j-1], 代表插入一個(gè)字符

delete = dp[i-1, j]，代表刪除一個(gè)字符

replace = dp[i-1, j-1]，代表替換一個(gè)字符

dpi = 1 + min(add, delete, replace)

時(shí)間復(fù)雜度 o(m * n)

java

class Solution {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();
        int[][] dp = new int[m + 1][n + 1];
        // base 
        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }

        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }
        
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (word1.charAt(i) == word2.charAt(j)) {
                    dp[i + 1][j + 1] = dp[i][j];
                } else {
                    int add = dp[i][j + 1];
                    int delete = dp[i + 1][j];
                    int rep = dp[i][j];
                    dp[i + 1][j + 1] = Math.min(Math.min(add, delete), rep) + 1;
                }
            }
        }
        return dp[m][n];
    }
}

python

class Solution:
    def minDistance(self, word1, word2):
        """
        :type word1: str
        :type word2: str
        :rtype: int
        """
        m = len(word1)
        n = len(word2)
        dp = [[0] * (n + 1) for _ in range(m + 1)]
        for i in range(m + 1):
            dp[i][0] = i
        for i in range(n + 1):
            dp[0][i] = i
        for i in range(m):
            for j in range(n):
                if word1[i] == word2[j]:
                    dp[i + 1][j + 1] = dp[i][j]
                else:
                    add = dp[i][j + 1]
                    delete = dp[i + 1][j]
                    replace = dp[i][j]
                    dp[i + 1][j + 1] = min(add, delete, replace) + 1
        return dp[m][n]

近期文章

【mysql】mysql系統(tǒng)架構(gòu)

【Leetcode】71. 簡(jiǎn)化路徑

【Leetcode】70. 爬樓梯