# 字符串S中包含字符串T的所有不同的子序列

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.

dp[i][j] = dp[i][j - 1] + (T[i - 1] == S[j - 1] ? dp[i - 1][j - 1] : 0)

    int numDistinct(string S, string T) {
if(S.empty())
return 0;
int n = T.size();
int m = S.size();
vector<vector<int>> vec(n+1, vector<int> (m+1, 0));
for(int i = 0; i< m; i++){
vec[0][i] = 1;
}
for(int i = 1; i<= n; i++){
for(int j = 1; j <= m; j++){
if(T[i-1] != S[j-1]) vec[i][j] = vec[i][j-1];
else vec[i][j] = vec[i][j-1]+vec[i-1][j-1];
}
}
return vec[n][m];
}

• 评论

• 上一篇
• 下一篇