forked from 14visheshjain/DataStructure-Algorithm-in-java
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathsubsequences.java
More file actions
39 lines (33 loc) · 868 Bytes
/
subsequences.java
File metadata and controls
39 lines (33 loc) · 868 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
36
37
38
39
package lecture7;
import java.util.ArrayList;
import java.util.Scanner;
public class subsequences {
public static void main(String[] args) {
Scanner a = new Scanner(System.in);
String s = a.next();
System.out.println(getSS(s).size());
for(int i=0 ; i<getSS(s).size() ; i++)
System.out.print(getSS(s).get(i)+" ");
}
public static ArrayList<String> getSS(String s){
if(s.length() ==0) {
ArrayList<String> recRes = new ArrayList<>();
recRes.add("");
return recRes;
}
char ch = s.charAt(0);
ArrayList<String> recRes =new ArrayList<> ();
s.substring(1);
recRes = getSS( s.substring(1) );
ArrayList<String> myRes = new ArrayList<>();
for(String val : recRes) {
myRes.add(val);
//myRes.add(ch+val);
}
for(String val : recRes) {
//myRes.add(val);
myRes.add(ch+val);
}
return myRes ;
}
}