leetcode 115. Distinct Subsequences 动态规划

题意

给定一个字符串 S 和一个字符串 T，计算在 S 的子序列中 T 出现的个数。

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

test cases

"rabbbit"
"rabbit"
"ababb"
"ab"
""
""
"a"
"b"
"abababaabbbbbaabaccabab"
"ab"
"ababb"
"aba"
"ababb"
"abab"
"ababb"
"abb"

解

dp[i][j]表示s前i个字符，t前j个字符的子序列个数。

状态转移方程见代码

// Runtime: 7 ms, faster than 44.99% of Java online submissions for Distinct Subsequences.
//Memory Usage: 39.4 MB, less than 5.65% of Java online submissions for Distinct Subsequences.
public int numDistinct(String s, String t) {
    if (s == null || t == null || s.length() < t.length())
        return 0;
    int[][] nums = new int[s.length() + 1][t.length() + 1];
    nums[0][0] = 1;
    int firstTimes = 0;
    for (int i = 1; i <= s.length(); i++) {
        if (s.charAt(i - 1) == t.charAt(0))
            firstTimes++;
        nums[i][1] = firstTimes;
    }
    for (int j = 2; j <= t.length(); j++) {
        for (int i = j; i <= s.length(); i++) {
            nums[i][j] = nums[i - 1][j];
            if (s.charAt(i - 1) == t.charAt(j - 1))
                nums[i][j] += nums[i - 1][j - 1];
        }
    }
    return nums[s.length()][t.length()];
}