class Solution {
List<List<Integer>> result = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> subsets(int[] nums) {
backtracking(nums,0);
return result;
}
private void backtracking(int[] nums, int startIndex){
result.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();
}
}
}
代码随想录——78. 子集
最新推荐文章于 2024-06-13 23:07:13 发布