leetcode-72

https://leetcode-cn.com/problems/edit-distance/

思路：dp

int minDistance(string word1, string word2) {
    if (word1.size() == 0 && word2.size() == 0) {
        return 0;
    }
    if (word1.size() == 0) {
        return word2.size();
    }
    if (word2.size() == 0) {
        return word1.size();
    }

    word1 = " " + word1;
    word2 = " " + word2;
    vector<vector<int> > dp(word1.size() + 1, vector<int>(word2.size() + 1, 0));
    //空串匹配特殊处理，word1为列
    for (int i = 1; i < word1.size() + 1; i++) {
        dp[i][0] = i;
    }
    //空串匹配特殊处理，word2为行
    for (int i = 1; i < word2.size() + 1; i++) {
        dp[0][i] = i;
    }
    for (int i = 1; i < word1.size() + 1; i++) {
        for (int j = 1; j < word2.size() + 1; j++) {
            if (word1[i - 1] == word2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1];
            } else {
                dp[i][j] = min(dp[i][j - 1], min(dp[i - 1][j], dp[i - 1][j - 1])) + 1;
            }
        }
    }
    return dp[word1.size()][word2.size()];
}