[LeetCode] 72. Edit Distance

[LeetCode] 72. Edit Distance

---

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

---

给两个字符串，然后用尽量少的操作去使它们一样。
如”abcd”和”aed”，只要将”abcd” 删除”b” 和 将”c”替换成”g” 2步。

思路： 经典的动规问题。

dp[i][j]表示转换S1[0:i]和S2[0:j]所需要的操作次数。
dp[i][j] = min { 1, 2, 3 }
1. if S1[i] == S2[j] then dp[i-1][j-1] else dp[i-1][j-1] + 1
2. dp[i-1][j] + 1
3. dp[i][j-1] + 1

dp	-	a	b	c	d
-	0	1	2	3	4
a	1	0	1	2	3
e	2	1	1	2	3
d	3	2	2	2	2

class Solution {
public:
    int minDistance(string word1, string word2) {
        int len1 = word1.length();
        int len2 = word2.length();
        vector< vector<int> > dp(len1+1, vector<int>(len2+1, 0));
        for (int i=0; i<len1+1; ++i) {
            dp[i][0] = i;
        }
        for (int j=0; j<len2+1; ++j) {
            dp[0][j] = j;
        }

        for (int i=1; i<len1+1; ++i) {
            for (int j=1; j<len2+1; ++j) {
                if (word1[i-1] == word2[j-1]) {
                    dp[i][j] = dp[i-1][j-1];
                } else {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                if (dp[i][j] > dp[i-1][j] + 1) {
                    dp[i][j] = dp[i-1][j] + 1;
                }
                if (dp[i][j] > dp[i][j-1] + 1) {
                    dp[i][j] = dp[i][j-1] + 1;
                }
            }
        }
        return dp[len1][len2];
    }
};

---

空间优化：dp[i][j]只依赖于dp[i-1][j-1]、dp[i-1][j]、dp[i][j-1]的时候，可以把空间从O(M*N)优化到O(N)：dp[j]

按i一行一行覆盖这个数组。

处理dp[j-1]之前，保留dp[j-1]到一个临时变量tmp，下次处理dp[j]表示dp[i][j]时，tmp就可以表示dp[i-1][j-1]，dp[j-1]表示dp[i][j-1]，dp[j] (未处理的)表示dp[i-1][j]。

详情看Discuss…