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()+;
        int col=word2.size()+;
        int isEqual=;

        int dp[row][col];
        for(int i=;i<col;++i){
            dp[][i]=i;
        }
        for(int i=;i<row;++i){
            dp[i][]=i;
        }
        for(int i=;i<row;++i)
            for(int j=;j<col;++j){
                isEqual=(word1[i-]==word2[j-])?:;
                dp[i][j]=min(dp[i-][j]+,min(dp[i][j-]+,dp[i-][j-]+isEqual));
            }
        return dp[row-][col-];
    }
};