LeetCode 115. Distinct Subsequences

最新推荐文章于 2024-02-14 11:24:21 发布

Llunnn

最新推荐文章于 2024-02-14 11:24:21 发布

阅读量162

点赞数

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

本文链接：https://blog.csdn.net/Llunnn/article/details/78736821

版权

算法分析专栏收录该内容

19 篇文章 0 订阅

订阅专栏

题目描述：
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).

Here is an example:
S = “rabbbit”, T = “rabbit”

Return 3.

解题思路：
用nums[i][j]表示串s的前i位中包含的串t的前j位的子序列数。
可见状态转移方程为 nums[i][j] = (s[j-1] == t[i-1]) ? nums[i][j-1] + nums[i-1][j-1] : nums[i][j-1]
据此用动态规划的方法解题即可。

代码：

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