FilesExpand file tree

 master

/

ReturnSubsequence.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (54 loc) · 1.83 KB

 master

/

ReturnSubsequence.java

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (54 loc) · 1.83 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

53

54

55

56

57

58

59

/*

This program will return all the subsequences of the input string in a string array;

Sample Input:

abc

Sample Output:

"" ( Empty String )

c

b

bc

a

ac

ab

abc

*/

import java.util.Scanner;

public class ReturnSubsequence {

/*

Main function will accept the given string and implement return subsequences function

*/

public static void main(String[] args) {

System.out.println("Enter String: ");

Scanner s=new Scanner(System.in);

String givenString=s.next(); //given string

String[] subsequence=returnSubsequence(givenString); //calling returnSubsequence() function

System.out.println("Subsequences : ");

for(int i=0;i<subsequence.length;i++) //print the given array of subsequences

{

System.out.println(subsequence[i]);

}

}

/*

Recursive function to return Subsequences

*/

private static String[] returnSubsequence(String givenString) {

if(givenString.length()==0) // If string is empty we will create an array of size=1 and insert "" (Empty string) in it

{

String[] ans=new String[1];

ans[0]="";

return ans;

}

String[] SmallAns=returnSubsequence(givenString.substring(1)); //recursive call to get subsequences of substring starting from index position=1

String[] ans=new String[2*SmallAns.length];// Our answer will be an array off string of size=2*SmallAns

int i=0;

for (;i<SmallAns.length;i++)

{

ans[i]=SmallAns[i]; //Copying all the strings present in SmallAns to ans string array

}

for (int k=0;k<SmallAns.length;k++)

{

ans[k+SmallAns.length]=givenString.charAt(0)+SmallAns[k]; // Insert character at index=0 of the given substring in front of every string in SmallAns

}

return ans;

}

}