Given a set of distinct integers, nums, return all possible subsets (the power set).
Note
The solution set must not contain duplicate subsets.
Example
Input: nums = [1,2,3]
Output:
1 2 3 4 5 6 7 8 9 10
|
[ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
|
Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
|
public List<List<Integer>> subsets(int[] nums) { List<List<Integer>> result = new ArrayList<>();
subsetsHelper(result, new ArrayList<>(), nums, 0); return result; }
private void (List<List<Integer>> result, List<Integer> subset, int[] nums, int idx) { result.add(new ArrayList<>(subset));
for (int i = idx; i < nums.length; i++) { subset.add(nums[i]); subsetsHelper(result, subset, nums, i + 1); subset.remove(subset.size() - 1); } }
|
近期评论