72. 编辑距离

要求：增删改使两串一样
思路：dp[i][j] 代表 word1 中前 i 个字符，变换到 word2 中前 j 个字符，最短需要操作的次数，增，dp[i][j] = dp[i][j - 1] + 删，dp[i][j] = dp[i - 1][j] + 1，改，dp[i][j] = dp[i - 1][j - 1] + 1

class Solution {
public:
    int minDistance(string word1, string word2) {
        int len1=word1.length(),len2=word2.length();
        vector<vector<int>> dp(len1+1,vector<int>(len2+1));
        for(int i=1;i<=len1;++i)
            dp[i][0]=i;
        for(int j=1;j<=len2;++j)
            dp[0][j]=j;
        for(int i=1;i<=len1;++i){
            for(int j=1;j<=len2;++j){
                if(word1[i-1]==word2[j-1])dp[i][j]=dp[i-1][j-1];
                else dp[i][j]=min(min(dp[i][j-1],dp[i-1][j]),dp[i-1][j-1])+1;
            }
        }
        return dp[len1][len2];
    }
};