代码随想录算法训练营第四十五天|LeetCode 115 不同的子序列，LeetCode 583 两个字符串的删除操作，LeetCode 72 编辑距离

1.LeetCode 115 不同的子序列

题目链接：115. 不同的子序列

class Solution:
    def numDistinct(self, s: str, t: str) -> int:
        dp = [[0] * (len(t)+1) for _ in range(len(s)+1)]
        for i in range(len(s) + 1):
            dp[i][0] = 1
        for i in range(1, len(t) + 1):
            dp[0][i] = 0
        
        for i in range(1, len(s) + 1):
            for j in range(1, len(t) + 1):
                if s[i - 1] == t[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]
                else:
                    dp[i][j] = dp[i - 1][j]
        
        return dp[-1][-1]

第一题结束

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

题目链接：583. 两个字符串的删除操作

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp = [[0] * (len(word2) + 1) for _ 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 - 1][j], dp[i][j - 1])

        return len(word1) + len(word2) - 2 * dp[-1][-1]

第二题结束

3.LeetCode 72 编辑距离

题目链接：72. 编辑距离

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp = [[0] * (len(word2)+1) for _ in range(len(word1)+1)]

        for i in range(len(word1) + 1):
            dp[i][0] = i
        for i in range(1, len(word2) + 1):
            dp[0][i] = i
        
        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]
                else:
                    dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
        
        return dp[-1][-1]

第三题结束

编辑距离总结：

感觉编辑距离这类题就是模板题，大体都相似，只需要考虑细节就可以了

今天用时2h