72. Edit DistanceDescriptionHintsSubmissionsDiscussSolutionDiscussPick OneGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a) Insert a characterb) Delete a characterc) Replace a character

这网站不错。。嗯

ED裸题

class Solution {public:    int minDistance(string word1, string word2) {       int lens=word1.size() ;    int lent=word2.size() ;    int f[1000][1000];    for(int i=1;i<=lens;i++) f[i][0]=i;    for(int i=1;i<=lent;i++) f[0][i]=i;    for(int i=1;i<=lens;i++){        for(int j=1;j<=lent;j++){            if(word1[i-1]==word2[j-1]) f[i][j]=f[i-1][j-1];            else{                f[i][j]=min(f[i-1][j-1],min(f[i][j-1],f[i-1][j]))+1;            }        }    }     return f[lens][lent];    }};