Leetcode|线性序列|583. 两个字符串的删除操作（变相LCS）

class Solution {
public:
    int minDistance(string word1, string word2) {
        int asize = word1.size();
        int bsize = word2.size();
        vector<vector<int>> dp(asize + 1, vector<int>(bsize + 1, 0));
        for (int i = 1; i <= asize; i++)
            for (int j = 1; j <= bsize; 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 asize + bsize - dp[asize][bsize] * 2;
    }
};