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')

通过递归关系，用dp[i][j]代表word1[0,i-1] conver to word2[0,j-1]的步骤，有以下几种情况

• word1[i]==word2[j]，dp[i][j]=dp[i-1][j-1]，有人会问为什么不是插入，删除，替换中的最小值，这是一种贪心算法的思想
• word1[i]!=word2[j]，有三种情况

1. 插入，dp[i][j]=dp[i-1][j]+1
2. 删除，dp[i][j]=dp[i][j-1]+1
3. 替换，dp[i][j]=dp[i-1][j-1]+1

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