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:
- The length of the given array will not exceed 15.
- The range of integer in the given array is [-100,100].
- The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
求所有递增的子序列,回溯算法求解,程序如下所示:
class Solution {
Set<List<Integer>> set = new HashSet();
public List<List<Integer>> findSubsequences(int[] nums) {
dfs(nums, 0, new ArrayList<Integer>());
List<List<Integer>> llist = new ArrayList<>(set);
return llist;
}
public void dfs(int[] nums, int begin, List<Integer> list){
if (begin > nums.length){
return;
}
if (list.size() >= 2){
set.add(new ArrayList<Integer>(list));
}
for (int i = begin; i < nums.length; ++ i){
if (list.size() > 0 && list.get(list.size() - 1) > nums[i]){
continue;
}
if (i != begin && nums[i] == nums[i-1]){
continue;
}
list.add(nums[i]);
dfs(nums, i+1, list);
list.remove(list.size() - 1);
}
}
}