Backtracking
Subsets
Given an array nums of unique integers, return all possible subsets of nums.
The solution set must not contain duplicate subsets. You may return the solution in any order.
Example 1:
Example 2:
Constraints:
1 <= nums.length <= 10-10 <= nums[i] <= 10
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
List<Integer> subset = new ArrayList<>();
dfs(nums, 0, subset, res);
return res;
}
private void dfs(int[] nums, int i, List<Integer> subset, List<List<Integer>> res) {
if (i >= nums.length) {
res.add(new ArrayList<>(subset));
return;
}
subset.add(nums[i]);
dfs(nums, i + 1, subset, res);
subset.remove(subset.size() - 1);
dfs(nums, i + 1, subset, res);
}
