easy
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> subsets(int[] nums) {
backtracking(nums, 0);
return res;
}
public void backtracking(int[] nums, int startIndex){
res.add(new ArrayList<>(path));
if(startIndex == nums.length) return;
for(int i = startIndex; i < nums.length;i++){
path.add(nums[i]);
backtracking(nums, i + 1);
path.removeLast();
}
}
}