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.

用二维数组的方法：

用matrix[i][j]记录S[i...m]中以T[j...n]为子序列的个数：

如果S[i]和T[j]不同，则matrix[i][j]=matrix[i+1][j]；

如果S[i]和T[j]相同，则matrix[i][j]=matrix[i+1][j]+matrix[i+1][j+1]。

class Solution {
public:
    int numDistinct(string &S,string &T){
		int len1=S.size(),len2=T.size();
		if(len1<len2){
			return 0;
		}
		vector<vector<int> > matrix(len1+1,vector<int>(len2+1,0));
		for(int i=0;i<=len1;i++){
			 matrix[i][len2]=1;
		}
   
		for(int i=len1-1;i>=0;i--){
			for(int j=len2-1;j>=0;j--){
				 matrix[i][j]=matrix[i+1][j]+matrix[i+1][j+1]*(S[i]==T[j]);	
			 
			}
		}
		return matrix[0][0];
	}
};

用一维数组的方法：

class Solution {
public:
    int numDistinct(string &S,string &T){
		int len1=S.size(),len2=T.size();
		if(len1<len2){
			return 0;
		}
		vector<int> dp(len2+1,0);
		dp[len2]=1;
		for(int i=len1-1;i>=0;i--){
			for(int j=0;j<len2;j++){
				 dp[j]+=dp[j+1]*(S[i]==T[j]);	
			}
		}
		return dp[0];
	}
};