C++ 6 line Simplest Code


  • 0
    H
    int minDistance(string word1, string word2) {
            int m = word1.size(), n = word2.size();
            vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
            
            for(int i = 1; i <= m; i++){
                for(int j = 0; j <= n; j++){
                    dp[i][j] = word1[i-1] == word2[j-1] ? dp[i-1][j-1]+1 : max(dp[i-1][j], dp[i][j-1]);
                }
            }
            
            return m + n - 2*dp[m][n];
        }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.