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

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) {
        
        if (s.size() == 0 || t.size() == 0) {
            return 0;
        }
        
        vector<vector<int>> dp(s.size() + 1, vector<int>(t.size()+1, 0));
        
        for (int i=0; i<=s.size(); i++) {
            dp[i][0] = 1;
        } //这个初始化很重要，相看"babgbag", T = "bag" 空也是子字符串
        
        for (int i=0; i<s.size(); i++) {
            for (int j=0; j<t.size(); j++) {
                if (j<=i) {
                    dp[i+1][j+1] = dp[i][j+1];
                    if (s[i] == t[j]) {
                        dp[i+1][j+1] += dp[i][j];
                    }
                }
            }
        }
        
        return dp[s.size()][t.size()];
    }
};