No.116 - LeetCode583

class Solution {
public:
    
int minDistance(string word1, string word2) {
    int N = word1.length();
    int M = word2.length();

    int dp[N+1][M+1];
    memset(dp,0x3f,sizeof(dp));

    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][j] = min(dp[i][j],dp[i-1][j-1]);
            else
                dp[i][j] = min(dp[i][j-1],dp[i-1][j])+1;
        }
    }
    return dp[N][M];
}
};