115. Distinct Subsequences(Leetcode每日一题-2021.03.17)

Problem

Given two strings s and t, return the number of distinct subsequences of s which equals t.

A string’s subsequence is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters’ relative positions. (i.e., “ACE” is a subsequence of “ABCDE” while “AEC” is not).

It is guaranteed the answer fits on a 32-bit signed integer.

Constraints:

• 0 <= s.length, t.length <= 1000
• s and t consist of English letters.

Example1

Example2

Solution

class Solution {
   
   
public:
    int numDistinct(string s