Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: nums = [1,2,3] Output: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
class Solution {
List<List<Integer>> res=new ArrayList();
public List<List<Integer>> subsets(int[] nums) {
if(nums.length==0) return res;
findCombination(nums,0,new ArrayList(nums.length));
return res;
}
private void findCombination(int[]nums,int starts,ArrayList<Integer>c){
if(c.size()==nums.length){
res.add(new ArrayList(0));
return;
}
for(int i=starts;i<nums.length;i++){
c.add(nums[i]);
res.add(new ArrayList(c));
findCombination(nums,i+1,c);
c.remove(c.size()-1);
}
}
}