-
Notifications
You must be signed in to change notification settings - Fork 0
/
subsets.java
52 lines (46 loc) · 1.35 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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class subsets {
public static void main(String[] args) {
int[] arr={1,2,2};
List<List<Integer>> ans=subsetduplicate(arr);
System.out.println(ans);
}
static List<List<Integer>> subsetarr(int[] arr){
List<List<Integer>> crust= new ArrayList<>();
// adding a new empty list
crust.add(new ArrayList<>());
for(int num :arr){
int n=crust.size();
for(int i=0;i<n;i++){
List<Integer> core=new ArrayList<>(crust.get(i));
core.add(num);
crust.add(core);
}
}
return crust;
}
static List<List<Integer>> subsetduplicate(int[] arr){
Arrays.sort(arr);
List<List<Integer>> crust= new ArrayList<>();
// adding a new empty list
crust.add(new ArrayList<>());
int s=0;
int e=0;
for(int i=0;i<arr.length;i++){
s=0;
if(i>0&&arr[i]==arr[i-1]){
s=e+1;
}
e=crust.size()-1;
int n=crust.size();
for(int j=s;j<n;j++){
List<Integer> core=new ArrayList<>(crust.get(j));
core.add(arr[i]);
crust.add(core);
}
}
return crust;
}
}