Leetcode 72. Edit Distance

原题：

Given two words word1 and word2, find the minimum number of steps required to convertword1 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

解决方法：

看起来很复杂的一道题，用DP来建模的话过程就很清晰了，dp[i][j]表示word1的i个字符和word2中的j个字符匹配的最小步数，最终求的就是dp[m][n]。

- dp[i][0]表示word2为空的时候的步数，其实就是需要删除所有字符。同理可以求出dp[0][j]。

- 当word1[i] == word2[j]时，不需要额外的步数，所以dp[i+1][j+1] = dp[i][j]。

- 当word1[i] != word2[j]时，无论是添加、删除、替换，都可以，都是一步，需要从中选出最小的那个，替换是dp[i][j],删除是dp[i][j+1],添加是dp[i+1][j],所以dp[i+1][j+1]= 1+ min(dp[i][j], dp[i][j+1],dp[i+1][j] );

代码：

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; i++){
            dp[i][0] = i;
        }
        
        for(int j = 1; j <= n; j++){
            dp[0][j] = j;            
        }
        
        for(int i = 0; i < m;i++){
            for(int j = 0; j < n;j++){
                if (word1[i] == word2[j]){
                    dp[i+1][j+1] = dp[i][j];
                }else{
                    dp[i+1][j+1] = 1 + min(dp[i][j], min(dp[i][j+1], dp[i+1][j]));
                }
            }
        }
        
        return dp[m][n];
    }