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

It's guaranteed the answer fits on a 32-bit signed integer.

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
    ^^^

本题是一道hard level的动规题。

代码：

class Solution {
public:
    int numDistinct(string s, string t) {
        int lenS = s.length(), lenT = t.length();
		vector<vector<int>> dp(lenS + 1, vector<int>(lenT + 1, 0));
		dp[0][0] = 1;
		for (int i = 0; i < lenS; i++)
		{
			dp[i + 1][0] = 1;
		}
		for (int i = 0; i < lenS; i++)
		{
			for (int j = 0; j < lenT; j++)
			{
				if (s[i] == t[j])
				{
					dp[i + 1][j + 1] = dp[i][j] + dp[i][j + 1];
				}
				else
				{
					dp[i + 1][j + 1] = dp[i][j + 1];
				}
			}
		}
		return dp[lenS][lenT];
    }
};