g0401_0500.s0491_increasing_subsequences.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
491\. Increasing Subsequences
Medium
Given an integer array `nums`, return all the different possible increasing subsequences of the given array with **at least two elements**. You may return the answer in **any order**.
The given array may contain duplicates, and two equal integers should also be considered a special case of increasing sequence.
**Example 1:**
**Input:** nums = [4,6,7,7]
**Output:** [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
**Example 2:**
**Input:** nums = [4,4,3,2,1]
**Output:** [[4,4]]
**Constraints:**
* `1 <= nums.length <= 15`
* `-100 <= nums[i] <= 100`