[leetcode][DP] 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

class Solution {
public:
        //table[i][j]表示从word1[0...i-1]到word2[0...j-1]的编辑距离
        //table[0][j]表示word1从空到word2[0...j-1]的编辑距离
        //table[i][0]表示从word1[0...i-1]到空Word2的编辑距离
        //s1、s2当前字符相同时，不用编辑，s1、s2都后移一步，table[i][j] = table [i-1][j-1] 
        //s1、s2当前字符不同时，编辑距离+1，可能有如下编辑方式，编辑距离等于如下最小者+1
        //插入：s1不动s2后移一步 table[i][j] = table[i][j-1] =1
        //删除:s1后移一步s2不动 table[i][j] = table[i-1][j] +1
        //替换:s1、s2都后移一步 table[i][j] = table[i-1][j-1] +1
    int minDistance(string word1, string word2) {
//        if(word2.empty()) return word1.size();//如果word2为空，则只用一种方法可以使word1变为word2，即删除word1的每一个元素
//        if(word1.empty()) return word2.size();//如果word1为空， 则只有一种方法可以是word1变为word2，即咋word1中依次添加word2的每一个元素
        
        //创建table
        int **table = new int *[word1.size()+1];
        for(int i = 0; i < word1.size()+1; ++i){
            table[i] = new int[word2.size()+1];
        }
        //初始化table
        for(int i = 0 ; i < word1.size()+1; ++i){
            table[i][0] = i;
        }
        for(int i = 0; i < word2.size()+1; ++i){
            table[0][i] = i;
        }
        //求解table
        for(int i = 1; i < word1.size()+1; ++i){
            for(int j = 1; j < word2.size()+1; ++j){
                if(word1[i-1] == word2[j-1]) table[i][j] = table[i-1][j-1];
                else table[i][j] = 1 + minThree(table[i-1][j], table[i][j-1], table[i-1][j-1]);
            }
        }
        int res = table[word1.size()][word2.size()];//word1到word2的编辑距离
        
        //销毁资源
        for(int i = 0; i < word1.size()+1; ++i){
            delete []table[i];
        }
        delete []table;
        
        return res;
    }
private:
    int minThree(int num1, int num2, int num3){
        int num = num1 < num2 ? num1 : num2;
        return num < num3 ? num : num3;
    }
};