115 - Distinct Subsequences

最新推荐文章于 2020-11-27 13:06:47 发布

绿水兰田

最新推荐文章于 2020-11-27 13:06:47 发布

阅读量155

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/95478118

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

Problem

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

Code

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