题目: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] 表示子串T前i个元素在原串S前j个元素中有多少种不同的子序列。
递推:当S【j】==T【j】时,dp[i][j]=dp[i][j-1]+dp[i-1][j-1]; 表示子串T第i个元素用和不用S的第j个元素,两种情况下递推求和。
当S【j】!=T【j】时,dp[i][j]=dp[i][j-1]; 即S的第j个元素没用,状态个数继承之前的。
注意考虑边界情况,两层循环算出结果。
class Solution {
public:
int numDistinct(string S, string T) {
int l1=S.size(),l2=T.size();
if(l1==0||l2==0||l1<l2)return 0;
vector<vector<int>>dp;
dp.resize(l2+1);
for(int i=0;i<l2;++i)dp[i].resize(l1+1);
for(int i=0;i<l2;++i)
{
for(int j=i;j<l1;++j)
{
if(T[i]==S[j])
{
if(i!=0)dp[i][j]=dp[i][j-1]+dp[i-1][j-1];
else dp[i][j]=1+(j>0?dp[i][j-1]:0);
}
else
{
if(j>0)dp[i][j]=dp[i][j-1];
else dp[i][j]=0;
}
}
}
return dp[l2-1][l1-1];
}
};