Distinct Subsequences

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.

题目：题意装换一下，S删除字符得到T，总共有多少种删除方法。

分析：动态规划，dp[i][j]表示S中0-i变成 T中0-j有多少种方法，dp[i][j] 如果S[i]==T[j] 那么dp[i][j]=dp[i-1][j-1] +dp[i-1][j]，相当于s[i]不起作用；

如果不相等，dp[i][j]=dp[i-1][j]；同，如果不相等，就是i-1得到j的方法数目。

代码：

class Solution {
public:
    int numDistinct(string S, string T) {
        int lens=S.length();
        int lent=T.length();
        vector< vector<int> > dp(lens+1,vector<int>(lent+1,0));
        int i,j;
        for(i=0;i<=lens;i++){
            dp[i][0]=1;//初始化，s[0-i]变成空串都是1种方法
        }
        for(i=1;i<=lens;i++){
            for(j=1;j<=lent;j++){
                if(S[i-1]==T[j-1]) dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
                else dp[i][j]=dp[i-1][j];
            }
        }
        return dp[lens][lent];//
    }  
};