LeetCode.491 Increasing Subsequences（递增子序列）

1.题目

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.

2.样例

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]]

• 约束条件

1 <= nums.length <= 15
-100 <= nums[i] <= 100

3.解答

• 说明：给定数组，找出满足升序的数组集合（可以无序返回），其中，相同的子集合认为是一个，例如：[4,6,7]和[4,6,7]。
• 提示：采用dfs递归，并采用set对子集合去重。
• 解答：

class Solution {
    public static List<List<Integer>> findSubsequences(int[] nums) {
        // 思路：典型的dfs递归方式进行逐个判断，判断当前元素是否比列表最后一个元素大
        if (nums == null || nums.length == 0 || nums.length == 1) {
            return new ArrayList<>();
        }

        Set<List<Integer>> res = new HashSet<>();
        dfs(nums, res, new ArrayList<>(), 0);
        return new ArrayList<>(res);
    }

    public static void dfs(int[] nums, Set<List<Integer>> res, List<Integer> subList, int index) {
        if (subList.size() > 1) {
            // 每次新增一个元素即可以认为是满足的一个子集合
            res.add(new ArrayList<>(subList));
        }

        for (int i = index; i < nums.length; i++) {
        	//	顺序查找比子集合最后一个元素大的数进行添加，再次递归
            if(subList.size()==0||subList.get(subList.size()-1)<=nums[i]){
                subList.add(nums[i]);
                dfs(nums, res, subList, i + 1);
                subList.remove(subList.size() - 1);
            }
        }
    }
}