题目:https://leetcode-cn.com/problems/distinct-subsequences/
class Solution {
public:
int numDistinct(string s, string t) {
/*
*动态规划
*dp[i][j]表示t的前i个字符可以由s的
*前j个字符组成的情况数
*
*/
int n = t.length(),m = s.length();
vector<vector<long long> > dp;
dp.resize(n+1);
for(int i = 0;i <= n;i++) dp[i].resize(m+1);
dp[0][0] = 1;
for(int i = 0;i <= m;i++) dp[0][i] = 1;
s = "#"+s;
t = "#"+t;
for(int i = 1;i <= n;i++) {
for(int j = i;j <= m;j++) {
dp[i][j] = dp[i][j-1];
if(t[i] == s[j]) dp[i][j] += dp[i-1][j-1];
}
}
for(int i = 1;i <= n;i++) {
for(int j = 1;j <= m;j++) {
printf("%d ",dp[i][j]);
}
printf("\n");
}
return dp[n][m];
}
};