Leetcode #72: Edit Distance

Leetcode_0072.cpp

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

I found that solution very popular and helpful:
https://www.youtube.com/watch?v=YYo3PIclzjk&ab_channel=EricProgramming