作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 日期 题目地址:https://leetcode.com/problems/increasing-subsequences/description/ 题目描述 Given an integer array, your task is to find all the different possible increasing subsequences…

题目如下: 解题思路:这题把我折腾了很久,一直没找到很合适的方法,主要是因为有重复的数字导致结果会有重复.最后尝试用字典记录满足条件的序列,保证不重复,居然Accept了. 代码如下: class Solution(object): def findSubsequences(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ res = [] queue = []…

[LeetCode]334. Increasing Triplet Subsequence 解题报告(Python) 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/problems/increasing-triplet-subsequence/description/ 题目描述: Given an unsorted array return whether an increasing subsequence of length 3 exists or…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 动态规划 日期 题目地址:https://leetcode.com/problems/distinct-subsequences/description/ 题目描述 Given a string S and a string T, count the number of distinct subsequences of S which equals…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 动态规划 日期 题目地址:https://leetcode.com/problems/distinct-subsequences-ii/description/ 题目描述 Given a string S, count the number of distinct, non-empty subsequences of S . Since the re…

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…

Description: Given two string S and T, you need to count the number of T's subsequences appeared in S. The fucking problem description is so confusing. Input: String s and t output: The number Analysis: It's a dynamic processing problem. I drew the d…

Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits. (Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.) Examp…

题目如下: Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 7. Example 1: Input: "abc" Output: 7 Explanation: The 7 distinct subsequences are "a", &…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 重建二叉树 数组保存节点 中序遍历时修改指针 参考资料 日期 题目地址:https://leetcode.com/problems/increasing-order-search-tree/description/ 题目描述 Given a tree, rearrange the tree in in-order so that the leftmo…