Increasing Subsequences

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.

Example:

Input: [4, 6, 7, 7]
Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]

Note:

1. The length of the given array will not exceed 15.
2. The range of integer in the given array is [-100,100].
3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.

思路：因为是subsequence，所以array的顺序不能变，不能用sort，跟subsetII一样，i > start && nums[i] == nums[i - 1];

不能用这个技巧去重复，那么只能用set来去重复；

class Solution {
    public List<List<Integer>> findSubsequences(int[] nums) {
        List<Integer> list = new ArrayList<Integer>();
        HashSet<List<Integer>> set = new HashSet<>();
        dfs(nums, list, 0, set);
        return new ArrayList(set);
    }
    
    private void dfs(int[] nums, List<Integer> list, int start, 
                        HashSet<List<Integer>> set) {
        if(list.size() > 1) {
            set.add(new ArrayList<Integer>(list));
        }
        for(int i = start; i < nums.length; i++) {
            if(list.isEmpty() || nums[i] >= list.get(list.size() - 1)) {
                list.add(nums[i]);
                dfs(nums, list, i + 1, set);
                list.remove(list.size() - 1);
            }
        }
    }
}