-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSubsets.java
More file actions
39 lines (34 loc) · 1019 Bytes
/
Subsets.java
File metadata and controls
39 lines (34 loc) · 1019 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/*
78. Subsets
Medium
Given an integer array nums of unique elements, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Example 1:
Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Example 2:
Input: nums = [0]
Output: [[],[0]]
Constraints:
1 <= nums.length <= 10
-10 <= nums[i] <= 10
All the numbers of nums are unique.
*/
class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
ArrayList<Integer> data= new ArrayList<>();
Solve(0,nums,data,res);
return res;
}
public static void Solve(int i,int[] nums,ArrayList<Integer> data,List<List<Integer>> res){
if(i==nums.length){
res.add(new ArrayList<Integer>(data));
return;
}
data.add(nums[i]);
Solve(i+1,nums,data,res);
data.remove(data.size()-1);
Solve(i+1,nums,data,res);
}
}