Edit Distance(动态规划，难)

Given 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 character
b) Delete a character
c) Replace a character

典型的dp题

class Solution {
public:
    int minDistance(string word1, string word2) {
        int row=word1.size()+1;
        int col=word2.size()+1;
        int isEqual=0;
        
        int dp[row][col];
        for(int i=0;i<col;++i){
            dp[0][i]=i;
        }
        for(int i=0;i<row;++i){
            dp[i][0]=i;
        }
        for(int i=1;i<row;++i)
            for(int j=1;j<col;++j){
                isEqual=(word1[i-1]==word2[j-1])?0:1;
                dp[i][j]=min(dp[i-1][j]+1,min(dp[i][j-1]+1,dp[i-1][j-1]+isEqual));
            }
        return dp[row-1][col-1];
    }
};