1子集
import java.util.LinkedList;
import java.util.List;
class Solution {
List<List<Integer>> res ;
public List<List<Integer>> subsets(int[] nums) {
res = new ArrayList<>();
List<Integer> track = new ArrayList<>();
backtrack(nums , 0 , track);
return res;
}
public void backtrack(int[] nums , int start , List<Integer> track){
res.add(new ArrayList<>(track));
for(int i = start ; i < nums.length ; i++){ // start 这个值是要发生变化的【start,nums.length-1】
track.add(nums[i]);
backtrack(nums , i + 1 , track);
track.remove(track.size()-1);
}
}
}