【LeetCode】Edit Distance

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

1. Insert a character
2. Delete a character
3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
Output: 5
Explanation: 
intention -> inention (remove 't')
inention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')

题解：如果正常思考很难入手，本题是个dp问题实际上本质就是最长公共子序列，因为没熟悉该模型，dp状态定义只着眼一个字符串的位置，利用dp[i][j]定义s1的i位置和s2的j位置的最短距离，方程dp[i][j]=dp[i-1][j-1]当最后字符相同，否则dp[i][j]=min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1])+1,这里还可以用滚动数组进一步优化空间，需要记录的信息是dp[i-1][j],dp[i][j-1],dp[i-1][j-1],如果正向遍历，dp[i][j-1]直接就是dp[j-1]，dp[i-1][j]就是当前未更新的dp[j]，所以剩下两个只需要两个指针来维护，一个记录prev记录当前的dp[i-1][j]一个用来记录上一层未更新的dp[i-1][j-1]，这两个满足递归关系，只需再最后更新tmp=prev,注意初始化边界，从1到n遍历可以直接用0边界来更新

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