leetcode 115 —— 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  ,

当
t[i] == s[j]时，配次数等于 dp[i-1][j-1]
当
t[i] != s[j]时，配次数等于 dp[i][j-1]与dp[i-1][j-1]的和

class Solution {
public:
	int numDistinct(string s, string t) {
		int m = t.size();
		int n = s.size();
        if(n<m||n==0) return 0;
		vector<vector<int>> dp (m, vector<int>(n, 0));
		dp[0][0] = (s[0] == t[0] ? 1 : 0);

		for (int i = 1; i < n; i++)
			dp[0][i] = (s[i] == t[0] ? dp[0][i - 1] + 1 : dp[0][i - 1]);

		for (int i = 1; i < m; i++){         //t
			for (int j = i; j < n; j++){	 //s
				if (t[i] == s[j])
					dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
				else
					dp[i][j] = dp[i][j - 1];
			}
		}
		return dp[m - 1][n - 1];		
	}
};