[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.

DP:

DP problem. The transitive function is f(i, j) = f(i - 1, j) + S[i] == T[j]? f(i - 1, j - 1) : 0 Where f(i, j) is the number of distinct sub-sequence for T[0:j] in S[0:i]

class Solution {
public:
    int numDistinct(string S, string T) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int ssize=S.length()+1;
        int tsize=T.length()+1;
        
        if(tsize==0 || ssize==0) return 0;
        
        vector<vector<int>> Subs(tsize,vector<int>(ssize,0));
        //Subs[i,j] is the number of distinct subsequences for T[:j] in S[:i]

        
        for(int j=1;j<tsize;j++)
        {
            for(int i=1;i<ssize;i++)
            {
                if(S[i-1]==T[j-1])
                {
                    if(j==1)
                        Subs[j][i]=1+Subs[j][i-1];
                    else
                        Subs[j][i]=Subs[j-1][i-1]+Subs[j][i-1];
                }
                else{
                    Subs[j][i]=Subs[j][i-1];
                }
            }
        }
        
        return Subs[tsize-1][ssize-1];
    }
};

Improvement:

We can use O(T)space since the ith-iteration only depends on the i-1th iteration and when we calculate from f(i, j) tof(i, 0) for the ith iteration.

public class Solution {
   public int numDistinct(String S, String T) {
        int[] occurence = new int[T.length() + 1];
        occurence[0] = 1;
        for(int i = 0; i < S.length(); i++){
            for(int j = T.length() - 1; j >= 0 ; j--)
                if(S.charAt(i) == T.charAt(j)){
                    if(occurence[j] > 0)
                        occurence[j + 1] += occurence[j];
                }
        }
        return occurence[T.length()];
    }
}