给定一个含不同整数的集合,返回其所有的子集
子集中的元素排列必须是非降序的,解集必须不包含重复的子集
class Solution {
/* @param S: A set of numbers.
* @return: A list of lists. All valid subsets.
*/
public ArrayList<ArrayList<Integer>> subsets(int[] nums) {
// write your code here
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> list = new ArrayList<Integer>();
Arrays.sort(nums);
subsetsHelper(result, list, nums, 0);
return result;
}
public void subsetsHelper(ArrayList<ArrayList<Integer>> result, ArrayList<Integer>list, int[] nums, int pos){
result.add(new ArrayList<Integer>(list) );
for(int i = pos; i < nums.length; i++){
list.add(nums[i]);
subsetsHelper(result, list, nums, i+1 );
list.remove(list.size() - 1);
}
}
}