algorithms/lcs at master · SravanthiAshokKumar/algorithms · GitHub

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
import java.io.*;
import java.util.*;
import java.lang.*;
class LCS
{
	Scanner sc = new Scanner(System.in);
	String s1,s2,resultant="\0";
	int l1,l2,rLength,find[][];
	void getSequences()
	{
		System.out.print("Enter two sequences: ");
		s1=sc.next();
		s2=sc.next();
		l1=s1.length();
		l2=s2.length();
		find=new int[l2+1][l1+1];
		for(int i=0;i<=l1;i++)
		{
			find[0][i]=0;
		}
		for(int i=0;i<=l2;i++)
		{
			find[i][0]=0;
		}
	}
	void findMat()
	{
		for(int i=1;i<=l2;i++)
		{
			for(int j=1;j<=l1;j++)
			{
				if(s2.charAt(i-1)==s1.charAt(j-1))
					find[i][j]=find[i-1][j-1]+1;
				else
					find[i][j]=maximum(find[i-1][j],find[i][j-1]);
			}
		}
		for(int i=0;i<=l2;i++)
		{
			System.out.println();
			for(int j=0;j<=l1;j++)
				System.out.print(find[i][j]+"\t");
		}
		rLength=find[l2][l1];
		System.out.println("\n\nLength of LCS: "+rLength);
		findLCS();
	}
	void findLCS()
	{
		int k=rLength-1;
		int i=l2;
		int j=l1;
		while(i>=0)
		{
			while(j>=0)
			{

				if(find[i][j]!=0)
				{
					if(s2.charAt(i-1)==s1.charAt(j-1))
					{
						resultant=s1.charAt(j-1)+resultant;
						i--;
						j--;k--;
					}
					else
					{
						if(find[i][j-1]>find[i-1][j])
							j--;
						else
							i--;
					}
				}
				else
				{
					i=-1;
					break;
				}
			}
		}
		System.out.println("\nLCS: "+resultant);
	}
	int maximum(int a,int b)
	{
		return a>b?a:b;
	}
}
public class lcs
{
	public static void main(String[] args)
	{
		LCS l=new LCS();
		l.getSequences();
		l.findMat();

	}
}