LeetCode-Distinct Subsequences（JAVA）

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

说明：定义dp[i][j]为s的前i个字符转化为t的前j个字符的数量，
因为可以删除s的字符，所以首先可以得到dp[i][j] += dp[i - 1][j]，当s[i - 1]==t[j - 1]时，dp[i][j] += dp[i - 1][j - 1]

class Solution {
    public int numDistinct(String s, String t) {
        int n1 = s.length();
        int n2 = t.length();
        
        int[][] dp = new int[n1 + 1][n2 + 1];
        dp[0][0] = 1;
        
        for(int i = 1; i < n1 + 1; i++) {
            dp[i][0] = 1;
        }
        
        for(int i = 1; i < n1 + 1; i++) {
            for(int j = 1; j < n2 + 1; j++) {
                
                if(s.charAt(i - 1) == t.charAt(j - 1)) {
                   dp[i][j] = dp[i][j] + dp[i - 1][j - 1];
                }
                dp[i][j] = dp[i][j] + dp[i - 1][j];
            }        
        }
        return dp[n1][n2];
    }
}