-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathSubsets.java
More file actions
59 lines (54 loc) · 2.02 KB
/
Subsets.java
File metadata and controls
59 lines (54 loc) · 2.02 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
public class Subsets {
public List<List<Integer>> subsets(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> res = new ArrayList<>();
res.add(new ArrayList<Integer>());
for(int i = 0; i < nums.length; i++) {
int temp_size = res.size();
for(int j = 0; j < temp_size; j++) {
ArrayList<Integer> subset = new ArrayList<>(res.get(j));
subset.add(nums[i]);
res.add(subset);
}
}
return res;
}
public List<List<Integer>> subsetsDFS(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> res = new ArrayList<>();
List<Integer> subset = new ArrayList<>();
dfs(nums, 0, res, subset);
return res;
}
public void dfs(int[] nums, int start, List<List<Integer>> res, List<Integer> subset) {
res.add(new ArrayList<Integer>(subset));
for(int i = start; i < nums.length; i++) {
subset.add(nums[i]);
dfs(nums, i + 1, res, subset);
subset.remove(subset.size() - 1);
}
}
public List<List<Integer>> subsetsDFSIterative(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> res = new ArrayList<>();
Deque<Integer> starts = new ArrayDeque<>();
Deque<ArrayList<Integer>> intermed = new ArrayDeque<>();
res.add(new ArrayList<Integer>());
for(int i = 0; i < nums.length; i++) {
starts.push(i);
intermed.add(new ArrayList<Integer>(Arrays.asList(nums[i])));
while(!starts.isEmpty()) {
int start = starts.pop();
List<Integer> subset = intermed.pop();
res.add(subset);
for(int j = nums.length - 1; j > start; j--) {
starts.push(j);
ArrayList<Integer> newSubset = new ArrayList<>(subset);
newSubset.add(nums[j]);
intermed.push(newSubset);
}
}
}
return res;
}}
}