leetcode-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，找出s的子串有多少个为t

分析：Dp方法，dp[i][j]记录s[0,j]中有多少个子串为t[0,i]

对t的每个字符，遍历s，每次循环，首先dp[i][j] = dp[i][j-1]，即当前位置的子串数至少与上一位置相同

若s[j]==t[i]，i==0时，dp[i][j]++;否则，dp[i][j] += dp[i-1][j-1]

即i=0时，累加即可，否则累加上上一次遍历的前一个位置的值（当前位置要放置s[j]，所以为j-1）

优化后，设s长度n，t长度m，时间O(mn)，空间O(n)

代码：

class Solution {
public:
    int numDistinct(string S, string T) {
        int ls = S.length(), lt = T.length();
        if(lt==0) return 1;
        if(ls==0) return 0;
        
        vector<int> dp[2];
        dp[0].assign(ls,0);
        dp[1].assign(ls,0);
        
        int pre = 0, i=0, k=0;
        for(; i<lt; i++,k=1-k)
        {
            if(pre<0) return 0;
            
            dp[k].assign(ls,0);
            int j=pre;
            pre = -1;
            
            for(; j<ls; j++)
            {
                if(j>0) dp[k][j] = dp[k][j-1];
                if(S[j]==T[i])
                {
                    if(pre<0) pre = j+1;
                    if(i==0) dp[k][j]++;
                    else dp[k][j] += dp[1-k][j-1];
                }
            }
        }
        return dp[1-k][ls-1];
    }
};