forked from cheungYX/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsubsets.java
39 lines (34 loc) · 1.04 KB
/
subsets.java
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
public class Solution {
/*
* @param nums: A set of numbers
* @return: A list of lists
*/
public List<List<Integer>> subsets(int[] nums) {
// write your code here
List<List<Integer>> res = new ArrayList<>();
if(nums == null) {
return res;
}
if (nums.length == 0) {
res.add(new ArrayList<Integer>());
return res;
}
Arrays.sort(nums);
int star = 0;
List<Integer> subset = new ArrayList<>();
Backtraking(subset, nums, star, res);
return res;
}
private void Backtraking(List<Integer> subset,
int[] nums,
int star,
List<List<Integer>> res) {
// deep copy
res.add(new ArrayList<>(subset));
for(int i = star; i < nums.length; i++) {
subset.add(nums[i]);
Backtraking(subset, nums, i + 1, res);
subset.remove(subset.size() - 1);
}
}
}