LeetCode 583. 两个字符串的删除操作

主页有其他数据结构内容（持续更新中）

难度：Medium

代码：

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp = [[0 for i in range(len(word2) + 1)] for j in range(len(word1) + 1)]
        for i in range(1, len(word1) + 1):
            for j in range(1, len(word2) + 1):
                if word1[i - 1] == word2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1] + 1
                else:
                    dp[i][j] = max(dp[i][j - 1], dp[i - 1][j])
        return len(word1) - dp[len(word1)][len(word2)] + len(word2) - dp[len(word1)][len(word2)]