72. Edit Distance

动态规划

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