leetcode583+删除元素是两string最终一样，最长公共子序列变版

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82355657

https://leetcode.com/problems/delete-operation-for-two-strings/description/

class Solution {
public:
    int minDistance(string word1, string word2) {
        int n1 = word1.size(), n2 = word2.size();
        vector<vector<int>> dp(n1+1, vector<int>(n2+1, 0));
        for(int i=1; i<=n1; i++){
            for(int j=1; j<=n2; j++){
                if(word1[i-1]==word2[j-1]){
                    dp[i][j] = dp[i-1][j-1]+1;
                }
                else{
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }
        return n1+n2-2*dp[n1][n2];
    }
};