Given a string S and a string T, count the number of distinct subsequences of S which equals T.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE"
is a subsequence of "ABCDE"
while "AEC"
is not).
Example 1:
Input: S ="rabbbit"
, T ="rabbit" Output: 3
Explanation: As shown below, there are 3 ways you can generate "rabbit" from S. (The caret symbol ^ means the chosen letters)rabbbit
^^^^ ^^rabbbit
^^ ^^^^rabbbit
^^^ ^^^
Example 2:
Input: S ="babgbag"
, T ="bag" Output: 5
Explanation: As shown below, there are 5 ways you can generate "bag" from S. (The caret symbol ^ means the chosen letters)babgbag
^^ ^babgbag
^^ ^babgbag
^ ^^babgbag
^ ^^babgbag
^^^
#include <iostream>
#include <vector>
using namespace std;
int numDistinct(string s, string t) {
vector<uint64_t> nums(t.length(), 0);
for(int i = 0; i < s.length(); ++i){
for(int j = t.length() - 1; j >= 0; --j){
if(s[i] == t[j]){
if(j == 0){
nums[j]++;
}
else{
nums[j] += nums[j - 1];
}
}
}
}
return nums[t.length() - 1];
}