Given a string S and a string T, count the number of distinct subsequences of T in S.
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).
Here is an example:
S = "rabbbit"
, T = "rabbit"
Return 3
.
Code:
<span style="font-size:14px;">class Solution {
public:
int numDistinct(string S, string T) {
const int lengthS = S.size(), lengthT = T.size();
int **dp = new int *[lengthS+1];
for (int i = 0; i < lengthS+1; ++i) {
dp[i] = new int[lengthT+1];
memset(dp[i], 0, sizeof(int)*(lengthT+1));
}
for (int i = 0; i < lengthS+1; ++i)
dp[i][0] = 1;
for (int i = 1; i < lengthS+1; ++i)
for (int j = 1; j < lengthT+1; ++j)
dp[i][j] = dp[i-1][j]+(S[i-1]==T[j-1]?dp[i-1][j-1]:0);
int result = dp[lengthS][lengthT];
for (int i = 0; i < lengthS+1; ++i)
delete [] dp[i];
delete [] dp;
return result;
}
};</span>