题目链接
![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/ff76eddb7495462785f923250efa7784.png)
回溯
class Solution {
List<List<Integer>> res = new ArrayList<List<Integer>>();
List<Integer> list = new ArrayList<Integer>();
boolean[] used;
public List<List<Integer>> findSubsequences(int[] nums) {
backtracking(nums,0,Integer.MIN_VALUE);
return res;
}
public void backtracking(int[] nums, int start, int last){
if(start == nums.length){
if(list.size() > 1){
res.add(new ArrayList<Integer>(list));
}
return ;
}
if(nums[start] >= last){
list.add(nums[start]);
backtracking(nums, start + 1, nums[start]);
list.removeLast();
}
if(nums[start] != last){
backtracking(nums, start + 1, last);
}
}
}