算法：子串的个数

问题

解决

class Solution:
   
        
    def maximumSubsequenceCount(self, text: str, pattern: str) -> int:
        s1=text+pattern[1]
        s2=pattern[0]+text
        # num1=numdistinct(s1,pattern)
        # print(self.numdistinct(s1,pattern))
        return max(self.numdistinct(s1,pattern),self.numdistinct(s2,pattern))
        
    def numdistinct(self,s:str,t:str)->int:
        dp=[[0]*(len(s)+1) for i in range(len(t)+1)]

        for i in range(len(s)+1):
            dp[0][i]=1
        # print(dp)
        for i in range(1,len(t)+1):
            for j in range(1,len(s)+1):
                if s[j-1]==t[i-1]:
                    dp[i][j]=dp[i-1][j-1]+dp[i][j-1]
                else:
                    dp[i][j]=dp[i][j-1]
        # print(dp)
        return dp[-1][-1]