leetcode 72 Edit Distance（DP）

题目链接：https://leetcode.com/problems/edit-distance/#/description

解题方案：与最长公共子序列类似，比较最后一个字符。

dp[i][j]表示S的前i个字符转变成T的前j个字符的最少操作数，则

• 若S[i]==T[j]，dp[i][j] = dp[i-1][j-1]
• 若S[i]!=T[j]，dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) +1

class Solution {
public:
    int minDistance(string word1, string word2) {
        int n = word1.length(), m = word2.length();
        vector<vector<int> > dp(n+1, vector<int>(m+1));
        for(int i = 0; i <= n; i++)     dp[i][0] = i;
        for(int j = 0; j <= m; j++)     dp[0][j] = j;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                if(word1[i-1] == word2[j-1])    dp[i][j] = dp[i-1][j-1];
                else    dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) + 1;//分别对应替换，删除，添加操作
            }
        }
        return dp[n][m];
    }
};