代码随想录：两个字符串的删除操作

class Solution {
public:
    int minDistance(string word1, string word2) {
        //即最长公共子序列，步数即为两者长度分别减公共子序列
        int m = word1.length();
        int n = word2.length();

        vector<vector<int>>dp = vector<vector<int>>(m+1,vector<int>(n+1,0));
        for(int i = 1;i<=m;i++){
            for(int j = 1;j<=n;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 m+n-dp[m][n]*2;
    }
};