-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLongestCmnSubsequence.java
More file actions
60 lines (56 loc) · 1018 Bytes
/
LongestCmnSubsequence.java
File metadata and controls
60 lines (56 loc) · 1018 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import java.util.Scanner;
public class LongestCmnSubsequence
{
public static void main(String[] args) {
Scanner scan= new Scanner(System.in);
String s1 = scan.next();
String s2= scan.next();
int[][] t = new int[s1.length()+1][s2.length()+1];
for(int i=1 ; i<=s1.length();i++)
{
//i first row characters
for(int j=1;j<=s2.length() ;j++)
{
//j is second row characters
if(s1.charAt(i-1)==s2.charAt(j-1))
{
t[i][j]=t[i-1][j-1]+1;
}
else {
t[i][j] = max(t[i-1][j],t[i][j-1]);
}
}
}
for(int i=0;i<=s1.length();i++)
{
for(int j=0;j<=s2.length();j++)
{
System.out.print(t[i][j]+" ");
}
System.out.println();
}
int n=s1.length();
int m= s2.length();
while (n>0&&m>0)
{
if(t[n][m]==t[n-1][m-1]+1)
{
System.out.println(s1.charAt(n-1));
n--;
m--;
}
else if(t[n][m]==t[n-1][m]) {
n--;
}
else {
m--;
}
}
}
public static int max(int a,int b)
{
if(a>b)
return a;
return b;
}
}