1006.单词变换

class Solution {
public:
int min(int a, int b)
{
    return a > b ? b : a;
}
    int minDistance(string word1, string word2) {
       int row = word1.size() + 1;
    int col = word2.size() + 1;
    int temp = 0;
    vector<vector<int>>edit(row, vector<int>(col));
    //初始化
    for (int i = 0; i < row; i++)
        edit[i][0] = i;
    for (int j = 0; j < col; j++)
        edit[0][j] = j;
    for (int i = 1; i < row; i++)
    {
        for (int j = 1; j < col; j++)
        {
            if (word1[i - 1] == word2[j - 1])
                temp = 0;
            else
                temp = 1;
            edit[i][j] = min(min(edit[i - 1][j] + 1, edit[i][j - 1] + 1), edit[i - 1][j - 1] + temp);
        }
    }
    return edit[row-1][col-1];
       }
};