-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
78.java
40 lines (37 loc) · 1.49 KB
/
78.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
39
40
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res=new ArrayList<>();
if(nums.length==0 || nums==null) return res;
helper(nums, res, new ArrayList<>(), 0);
return res;
}
private void helper(int[] nums, List<List<Integer>> res, List<Integer> list, int index){
res.add(new ArrayList<Integer>(list));
for(int i=index; i<nums.length; i++){
int num=nums[i];
list.add(num);
helper(nums, res, list, i+1);
list.remove(list.size()-1);
}
}
}
__________________________________________________________________________________________________
sample 34488 kb submission
class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
findSubsets(nums, result, new ArrayList<>(), 0);
return result;
}
private void findSubsets(int[] nums, List<List<Integer>> result, List<Integer> tempList, int start){
result.add(new ArrayList<>(tempList));
for(int i=start; i<nums.length; i++){
tempList.add(nums[i]);
findSubsets(nums, result, tempList, i+1);
tempList.remove(tempList.size()-1);
}
}
}
__________________________________________________________________________________________________