**Leetcode_distinct-subsequences

地址： http://oj.leetcode.com/problems/distinct-subsequences/

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.

思路：DFS的方法TLE。对dp还是不熟，这样的问题应该立马想到用dp来做的。当在重复子问题数目关于输入量呈指数级增长时，dp特别有用。

dp里比较常见的类型，要多练习。

参考代码：

class Solution {
public:
    int numDistinct(string S, string T) {
        if(S.empty() || S.length() < T.length())
            return 0;
        vector<vector<int>>dp;
        for(int i=0; i<=S.length(); ++i)
        {
            vector<int>tmpvec(T.length()+1, 0);
            dp.push_back(tmpvec);
        }
        for(int i = 1; i<=S.length(); ++i)
        {
            for(int j = 1; j<=i && j<=T.length(); ++j)
            {
                if(S[i-1]==T[j-1])
                {
                    if(i==1 || j==1)
                        dp[i][j] = 1;
                    else
                        dp[i][j] = dp[i-1][j-1];
                }
                if(j<i)//j<=i is also OK, but at that time dp[i-1][j] all equals to zero.
                {
                    dp[i][j]+=dp[i-1][j];
                }
            }
        }
        return dp[S.length()][T.length()];
    }
};