小黑昨日面试收到激励，摆正了自己的态度，意识到了自己的不足今后继续积累教训的leetcode之旅:115. 不同的子序列-CSDN博客

记忆化搜索递归

class Solution:
    def numDistinct(self, s: str, t: str) -> int:
        # 每一次递归的逻辑：
        #   (1) 字符串的尾部相等的情况,s[i] = s[j]
                # xxxxxs 
                # kkkks
                # dfs(i)(j) = dfs(i-1)(j) + dfs(i-1)(j-1)
        #   (2) 字符串尾部不相等的情况
                # xxxxx1
                # kkkk2
                # dfs(i)(j) = dfs(i-1)(j)
        # 初始化缓存
        arr = [[-1] * len(t) for _ in range(len(s))]
        def dfs(i, j):
            if j == -1:
                return 1
            if i == -1:
                return 0
    
            if arr[i][j] != -1:
                
                return arr[i][j]
            if s[i] == t[j]:
                arr[i][j] = dfs(i - 1, j) + dfs(i - 1, j - 1)
            else:
                arr[i][j] = dfs(i - 1, j)
            return arr[i][j]
        return dfs(len(s) - 1, len(t) - 1)

在这里插入图片描述

动态规划

class Solution:
    def numDistinct(self, s: str, t: str) -> int:
        # 每一次递归的逻辑：
        #   (1) 字符串的尾部相等的情况,s[i] = s[j]
                # xxxxxs 
                # kkkks
                # dfs(i)(j) = dfs(i-1)(j) + dfs(i-1)(j-1)
        #   (2) 字符串尾部不相等的情况
                # xxxxx1
                # kkkk2
                # dfs(i)(j) = dfs(i-1)(j)
        # 初始化动态规划数组
        dp = [[0] * (len(t)+1) for _ in range(len(s)+1)]
        for i in range(len(s)+1):
            for j in range(len(t)+1):
                if j == 0:
                    dp[i][j] = 1
                elif i == 0:
                    dp[i][j] = 0
                elif s[i-1] != t[j-1]:
                    dp[i][j] = dp[i-1][j]
                else:
                    dp[i][j] = dp[i-1][j] + dp[i-1][j-1]
        return dp[len(s)][len(t)]