public class Solution {
public List<List<Integer>> findSubsequences(int[] nums) {
if (nums == null || nums.length == 0) {
return new ArrayList();
}
Set<List<Integer>> rstSet = new HashSet<List<Integer>>();
List<Integer> path = new ArrayList<Integer>();
helper(nums, 0, path, rstSet);
List rst = new ArrayList(rstSet);
return rst;
}
private void helper(int[] nums, int index, List<Integer> path, Set<List<Integer>> rstSet) {
if (path.size() >= 2) {
rstSet.add(new ArrayList(path));
}
for (int i = index; i < nums.length; i++) {
if (path.size() == 0 || nums[i] >= path.get(path.size() - 1)) {
path.add(nums[i]);
helper(nums, i + 1, path, rstSet);
path.remove(path.size() - 1);
}
}
}
}