lintcode: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).

Example

S = "rabbbit", T = "rabbit"

Return 3.

class Solution {
public:    
    /**
     * @param S, T: Two string.
     * @return: Count the number of distinct subsequences
     */
    int numDistinct(string &S, string &T) {
        // write your code here
        int stringSize = S.size();
        int templateSize = T.size();
        
        if (stringSize == 0 || templateSize == 0 || templateSize > stringSize)
            return 0;
            
        vector<vector<int>> dp(templateSize+1, vector<int>(stringSize+1));
        
        dp[0][0] = 1;
        
        for (int j=1; j<=stringSize; j++)
        {
            dp[0][j] = 1; //空串也是S的自序列
        }
        
        for (int i=1; i<=templateSize; i++)
        {
            dp[i][0] = 0;
        }
        
        for (int i=1; i<=templateSize; i++)
        {
            for (int j=1; j<=stringSize; j++)
            {
                if (S[j-1] == T[i-1])
                {
                    dp[i][j] = dp[i][j-1] + dp[i-1][j-1];
                }
                else
                {
                    dp[i][j] = dp[i][j-1];
                }
            }
        }
        
        return dp[templateSize][stringSize];
    }
};