Leetcode之Distinct Subsequences

题目：

Given a string S and a string T, count the number of distinct subsequences of S which equals T.

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

Example 1:

Input: S = "rabbbit", T = "rabbit"
Output: 3
Explanation:

As shown below, there are 3 ways you can generate "rabbit" from S.
(The caret symbol ^ means the chosen letters)

rabbbit
^^^^ ^^
rabbbit
^^ ^^^^
rabbbit
^^^ ^^^

Example 2:

Input: S = "babgbag", T = "bag"
Output: 5
Explanation:

As shown below, there are 5 ways you can generate "bag" from S.
(The caret symbol ^ means the chosen letters)

babgbag
^^ ^
babgbag
^^    ^
babgbag
^    ^^
babgbag
  ^  ^^
babgbag
    ^^^

代码：

class Solution {
public:
    int numDistinct(string s, string t) {
        int slen = s.length();
	int tlen = t.length();
	long int** matrix = new long int*[tlen + 1];
	for (int i = 0; i < tlen + 1; i++) {
		matrix[i] = new long int[slen + 1];
	}
	for (int i = 0; i <= slen; i++) {
		matrix[0][i] = 1;
	}
	for (int j = 1; j <= tlen; j++) {
		matrix[j][0] = 0;
	}

	for (int i = 1; i <= tlen; i++) {
		for (int j = 1; j <= slen; j++) {
			if (s[j - 1] == t[i - 1]) {
				matrix[i][j] = matrix[i - 1][j - 1] + matrix[i][j - 1];
			}
			else matrix[i][j] = matrix[i][j - 1];
		}
	}

	int res = matrix[tlen][slen];
	delete[] matrix;
	return res;
    }
};

想法：

字符串配准——条件反射：动态规划

可以写出来再找规律

注意溢出问题