1.1 KiB
1.1 KiB
TODO 0115. Distinct Subsequences hard
Given two strings s and t, return the number of distinct subsequences of s which equals t.
The test cases are generated so that the answer fits on a 32-bit signed integer.
Example 1:
Input: s = "rabbbit", t = "rabbit"
Output: 3
Explanation:
As shown below, there are 3 ways you can generate "rabbit" from s.
rabbbit
rabbbit
rabbbitExample 2:
Input: s = "babgbag", t = "bag"
Output: 5
Explanation:
As shown below, there are 5 ways you can generate "bag" from s.
babgbag
babgbag
babgbag
babgbag
babgbagConstraints:
1 <= s.length, t.length <= 1000sandtconsist of English letters.
TODO Approach
Write your approach here.
TODO Python
class Solution:
def numDistinct(self, s: str, t: str) -> int:TODO C++
class Solution {
public:
int numDistinct(string s, string t) {
}
};