C++ simple and fast solution

  • 0
        int minDistance(string word1, string word2) {
            if(word1.size()==0) return word2.size();
            if(word2.size()==0) return word1.size();
            vector<vector<int>> dp(word1.size(), vector<int>(word2.size(), 0));
            for(int i=0;i<word1.size();i++) {
                if(word1[i]==word2[0]||(i>0&&dp[i-1][0]==1)) dp[i][0]=1;
                for(int j=1;j<word2.size();j++) {
                    if(word1[i]==word2[j]) {
                        if(i==0) dp[0][j]=1;
                        else dp[i][j]=dp[i-1][j-1]+1;
                    else {
                        if(i==0) dp[0][j]=dp[0][j-1];
                        else dp[i][j]=max(dp[i-1][j], dp[i][j-1]);
            return word1.size()+word2.size()-2*dp[word1.size()-1][word2.size()-1];

Log in to reply

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