leetcode 72. 编辑距离

递推公式

dp[i][j] = min(min(dp[i - 1][j] + 1, dp[i][j - 1] + 1), dp[i - 1][j - 1] + 1);

dp[i][j] = min(min(dp[i - 1][j] + 1, dp[i][j - 1] + 1  表示的是删除元素，因为增加元素和删除元素是一样的，具体的原因后面理解深刻了再说，现在还讲不太清楚

dp[i - 1][j - 1] + 1 这个表示的是替换元素，在之前的基础上替换

class Solution {
public:
    int minDistance(string word1, string word2) {

        vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1, 0));

        for(int i = 0; i <= word1.size(); i++)
            dp[i][0] = i;
        for(int j = 0; j <= word2.size(); j++)
            dp[0][j] = j;

        for(int i = 1; i <= word1.size(); i++)
        {
            for(int j = 1; j <= word2.size(); j++)
            {
                if(word1[i - 1] == word2[j - 1])
                    dp[i][j] = dp[i - 1][j - 1];
                else
                    dp[i][j] = min(min(dp[i - 1][j] + 1, dp[i][j - 1] + 1), dp[i - 1][j - 1] + 1);
            }
        }

        return dp[word1.size()][word2.size()];
    }
};