【Lintcode】119.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:

• Insert a character
• Delete a character
• Replace a character

Example

Given word1 = "mart" and word2 = "karma", return 3.

题解：

Solution 1 ()

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