-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsubset.java
More file actions
35 lines (26 loc) · 724 Bytes
/
subset.java
File metadata and controls
35 lines (26 loc) · 724 Bytes
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
package ArrayBasedProblems;
public class subset {
public static void main(String[] args) {
// System.out.println("Hello, World!");
int a[]={1,2,3};
for(int i=0;i<a.length;i++){
String s="";
int k=1;
while(k<a.length){
for(int j=i;j<k;j++)
{
s+=a[j]+" ";
}
k++;
System.out.println();
}
System.out.print(s);
}
}
}
// Explaination of problem:
// Given an integer array nums of unique elements, return all possible subsets (the power set).
// The solution set must not contain duplicate subsets. The subsets can be returned in any order.
// output
// 1 1 2
// 2