class Solution {
List<List<Integer>> res = new LinkedList<>();
public List<List<Integer>> subsets(int[] nums) {
dfs(nums, 0, new LinkedList<>());
return res;
}
public void dfs(int[] nums, int u, LinkedList<Integer> out) {
if (u == nums.length) {
res.add(new LinkedList<>(out));
return;
}
out.add(nums[u]);
dfs(nums, u + 1, out);
out.removeLast();
dfs(nums, u + 1, out);
}
}
子集
最新推荐文章于 2023-01-18 19:40:42 发布