[动态规划] leetcode 115 Distinct Subsequences

problem:https://leetcode.com/problems/distinct-subsequences/

字符匹配类型题目。

class Solution {
public:
    vector<vector<int>> dp;
    int numDistinct(string& s, string& t, int i, int j) {
        if(j == t.size()) return 1;
        if(i == s.size()) return 0;
        if(dp[i][j] != -1) return dp[i][j];
        if(s[i] == t[j])
        {
            return dp[i][j] = numDistinct(s, t, i + 1, j + 1) + numDistinct(s, t, i + 1, j);
        }
        else
        {
            return dp[i][j] = numDistinct(s, t, i + 1, j);
        }
    }
    int numDistinct(string s, string t) {
        dp.resize(s.size(), vector<int>(t.size(), -1));
        return numDistinct(s, t, 0, 0);
    }
};

原文地址：https://www.cnblogs.com/fish1996/p/11330015.html

时间： 2024-10-11 16:02:14

[动态规划] leetcode 115 Distinct Subsequences的相关文章

Leetcode 115 Distinct Subsequences 解题报告

Distinct Subsequences Total Accepted: 38466 Total Submissions: 143567My Submissions Question Solution Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from

leetcode 115. Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of T in S. 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

leetcode 115 Distinct Subsequences ----- java

Java for LeetCode 115 Distinct Subsequences【HARD】

动态规划之115 Distinct Subsequences

题目链接:https://leetcode-cn.com/problems/distinct-subsequences/description/ 参考链接:https://www.cnblogs.com/springfor/p/3896152.html http://blog.csdn.net/abcbc/article/details/8978146 dp[i][j]:S使用前i个字符,T使用前面j个字符.dp[0][0]使用S前0个字符,使用T前0个字符. 当T为空的时候,空字符串是任何S串

【leetcode】Distinct Subsequences

问题:给定两个字符串S,T,对于S,可以删除其中的任意多个(包括0)字符,使其得到T.问有多少种删法可以得到T. 举例分析: S:ababa T: aba dp[i][j] : 表示 S 从0 ~ i - 1,T从0~j - 1,所得到的方法数.i,j 表示长度. 初始条件:dp[i][0] = 1,T为空串,而空串总是任意串的字串.即,将S串的所有字符都删掉,就得到T. 状态转移方程: dp[ i ] [ j ] = dp[ i - 1] [ j - 1] + dp[ i - 1] [ j ]

115 Distinct Subsequences

115 Distinct Subsequences 这道题是dp, 我定义的dp[i][j] 为用t[:i] 和s[:j] 的disitinct subsequence排列数 class Solution: # @param {string} s # @param {string} t # @return {integer} def numDistinct(self, s, t): m, n = len(t), len(s) if m == 0 or n == 0: return 0 dp,cu

115. Distinct Subsequences（js）

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 charac

leetcode 之 Distinct Subsequences

Distinct Subsequences Given a string S and a string T, count the number of distinct subsequences of T in S. 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 di