LC72 Edit Distance

一道字符串题，在没有想到用动态规划前感觉无从下手。注意动态规划的初始化操作。

class Solution {
public:
    int minDistance(string word1, string word2) {
        if(word1.size()==0||word2.size()==0)
            return word1.size()==0?word2.size():word1.size();
        int width=word1.size()+1;
        int height=word2.size()+1;
        vector<vector<int> > iv(height,vector<int>(width,0));
        for(int i=0;i<width;i++)
            iv[0][i]=i;
        for(int i=0;i<height;i++)
            iv[i][0]=i;
        for(int i=1;i<height;i++)
        {
            for(int j=1;j<width;j++)
            {
                if(word1[j-1]==word2[i-1])
                {
                    iv[i][j]=iv[i-1][j-1];
                }
                else
                {
                    int tmp=(iv[i-1][j]>iv[i][j-1])?(iv[i][j-1]+1):(iv[i-1][j]+1);
                    iv[i][j]=(tmp>(iv[i-1][j-1]+1))?(iv[i-1][j-1]+1):tmp;
                }
            }
        }
        return iv[word2.size()][word1.size()];
    }
};