Package g0401_0500.s0491_increasing_subsequences

Class Solution

java.lang.Object

g0401_0500.s0491_increasing_subsequences.Solution

public class Solution
extends Object

491 - Increasing Subsequences.<p>Medium</p> <p>Given an integer array <code>nums</code>, return all the different possible increasing subsequences of the given array with <strong>at least two elements</strong>. You may return the answer in <strong>any order</strong>.</p> <p>The given array may contain duplicates, and two equal integers should also be considered a special case of increasing sequence.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,6,7,7]</p> <p><strong>Output:</strong> [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4,4,3,2,1]</p> <p><strong>Output:</strong> <a href="4,4">4,4</a></p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 15</code></li> <li><code>-100 <= nums[i] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<List<Integer>>	findSubsequences(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findSubsequences

public List<List<Integer>> findSubsequences(int[] nums)