forked from prakashshuklahub/Interview-Questions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
78 Subsets
37 lines (28 loc) · 819 Bytes
/
78 Subsets
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
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:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> subset = new ArrayList();
dfs(subset,0,nums,new ArrayList());
return subset;
}
void dfs( List<List<Integer>> subset,int index,int[] nums,List<Integer> current){
subset.add(new ArrayList(current));
for(int i=index;i<nums.length;i++){
current.add(nums[i]);
dfs(subset,i+1,nums, current);
current.remove(current.size()-1);
}
}