【distinct-subsequences】

Given a string S and a string T, count the number of distinct subsequences ofT 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"

Return3.

思路：动态规划思想

dp[i][j]表示S中前i个字符构成的字符串包含T中前j个字符构成的字符串的长度，

当s[i-1]==T[j-1]时，则新的dp值可以说不使用第i个字符，却能构成T中j子串

class Solution {
public:
	int numDistinct(string S, string T)
	{
		int slen = S. length();
		int tlen = T.length();

		vector<vector<int>> dp;
		vector<int> tmp(tlen+1, 0);
		tmp[0] = 1;

		for (int i=0; i<=slen; i++)
		{
			dp.push_back(tmp);
		}

		for (int i=1; i<=slen; i++)
		{
			for(int j=1; i<=tlen; j++)
			{
				if (S[i-1]==T[j-1])
				{
					dp[i][j] = dp[i-1][j] + dp[i-1][j-1];
				}
				else
				{
					dp[i][j] = dp[i-1][j];
				}
			}
		}

		return dp[slen][tlen];
	}
	
};