# 看著大佬的題解做了出來,但寫不出來題解
class Solution:
def numDistinct(self,s:str,t:str) -> int:
n1 = len(s)
n2 = len(t)
dp = [[0] * (n1 + 1) for _ in range((n2 + 1))]
for j in range(n1 + 1):
dp[0][j] = 1
for i in range(1,n2 + 1):
for j in range(1,n1 + 1):
if t[i - 1] == s[j - 1]:
dp[i][j] = dp[i-1][j - 1] + dp[i][j-1]
else:
dp[i][j] = dp[i][j - 1]
return dp[-1][-1]
轉載請註明出處,本文鏈接:https://www.uj5u.com/houduan/105979.html
標籤:Python
上一篇:apktool重新打包添加簽名
