leetcode【72】Edit Distance

问题描述：

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

1. Insert a character
2. Delete a character
3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation: 
intention -> inention (remove 't')
inention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')

源码：

动态规划法

动态方程如下：

其中当word1[i]==word2[j]的时候，diff(i, j)=0，否则等于1。

效果不是很好：

class Solution {
public:
    int minDistance(string word1, string word2) {
        int n1 = word1.size(), n2 = word2.size();
        vector<vector<int>> result(n1+1, vector<int>(n2+1, 0));
        for(int i=0; i<n1+1; i++)   result[i][0] = i;
        for(int i=0; i<n2+1; i++)   result[0][i] = i;
        for(int i=1; i<=n1; i++){
            for(int j=1; j<=n2; j++){
                int tag = word1[i-1]==word2[j-1]? 0:1;
                result[i][j] = min(tag+result[i-1][j-1], min(result[i-1][j]+1, result[i][j-1]+1));
            }
        }
        return result[n1][n2];
    }
};

改进：

还是动态规划方法，不过动态方程可以改一下，因为dp[i-1][j-1]必然小于等于min(dp[i][j-1]+dp[i-1][j])+1（可以自己找几个例子看看）。所以若两者相等的时候直接让dp[i][j]=dp[i-1][j-1]即可。

还有就是矩阵边缘也可以放在主循环中，减少循环次数。

class Solution {
public:
    int minDistance(string word1, string word2) {
        int n1 = word1.size(), n2 = word2.size();
        vector<vector<int>> result(n1+1, vector<int>(n2+1, 0));
        for(int i=0; i<=n1; i++){
            for(int j=0; j<=n2; j++){
                if(i==0)    result[i][j] = j;
                else if(j==0)   result[i][j] = i;
                else if(word1[i-1]==word2[j-1])     result[i][j] = result[i-1][j-1];
                else result[i][j] = min(result[i-1][j-1], min(result[i][j-1], result[i-1][j])) + 1;
            }
        }
        return result[n1][n2];
    }
};