72:Edit Distance【DP】【字符串】

题目链接：click~

/*题意：输入两个单词word1和word2，求从word1转换成word2的最少步骤
        操作有：删除，添加，替换一个字符
 */

/**
 *思路：DP，d[i][j]表示word1[0,...,i-1]转换到word2[0,...,j-1]的最少步骤
 *      d[i][j]= d[i-1][j-1],当word1[i-1]与word2[j-1]相等时
 *               1 + min(d[i-1][j-1],d[i-1][j],d[i][j-1]),替换，插入，删除word2最小步骤
 *                  
 */

class Solution {
public:
    int minDistance(string word1, string word2) {
        int len1 = word1.size();
        int len2 = word2.size();
        if(len1 == 0) return len2;
        if(len2 == 0) return len1;
        vector<vector<int> > d(len1+1, vector<int>(len2+1, 0));
        d[0][0] = 0; //表示word1和word2都为空时，最小步骤为0
        
        //word2为空时，word1长度为i的情况，也就是word1从头删除
        //i个字符转换成word2的最小步骤
        for(int i = 1; i <= len1; i ++) d[i][0] = i; 
        
        //word1为空时，word2长度为j的情况，也就是word1从空添加
        //j个字符转换成word2的最小步骤
        for(int j = 1; j <= len2; j ++) d[0][j] = j;

        for(int i = 1; i <= len1; i ++) {
            for(int j = 1; j<= len2; j++) {
                if(word1[i-1] == word2[j-1])
                    d[i][j] = d[i-1][j-1];
                else
                    d[i][j] = 1 + min(d[i-1][j-1], min(d[i-1][j], d[i][j-1]));
            }
        }
        return d[len1][len2];
    }
};