两个字符串的删除操作-动态规划583-python

没看答案，只允许删除操作的编辑距离问题。

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        '''
        state: dp[i][j]表示word1[:j]和word2[:i]相同所需的最小步数
        basecase: word1或word2为空字符串时的最小步数,即dp数组的第一行和第一列
        transfer: 若word1[j-1]与word2[i-1]匹配，则dp[i][j]继承dp[i-1][j-1]；
                  若word1[j-1]与word2[i-1]不匹配，则考虑删除word1[j-1]或word2[i-1]，
                  即取dp[i-1][j]和dp[i][j-1]中的最小值，再加1次删除操作。
        result: dp[-1][-1]
        '''
        
        m, n = len(word1), len(word2)
        dp = [[0] * (m+1) for _ in range(n+1)]

        for i in range(m+1):
            dp[0][i] = i
        for j in range(n+1):
            dp[j][0] = j
        
        for i in range(1, n+1):
            for j in range(1, m+1):
                if word1[j-1] == word2[i-1]:
                    dp[i][j] = dp[i-1][j-1]
                else:
                    dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + 1

        return dp[-1][-1]