72. 编辑距离

看到群友提到了这个东西，顺便看看是什么
这不就是一题简单的二维dp吗...居然是hard

72. 编辑距离

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