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

2021-09-18 16:44:24 浏览数 (1)

1 动态规划(二维动态规划)

代码语言:javascript复制
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;
    }
};

0 人点赞