-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path7a.cpp
52 lines (50 loc) · 868 Bytes
/
7a.cpp
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
#include<iostream>
#include<string.h>
using namespace std;
void LCS(char *X,char *Y,int m,int n)
{
int L[m+1][n+1];
for(int i=0;i<=m;i++)
{
for(int j=0;j<=n;j++)
{
if(i==0 || j==0)
L[i][j]=0;
else if(X[i-1]==Y[j-1])
L[i][j]=L[i-1][j-1]+1;
else
L[i][j]=max(L[i][j-1],L[i-1][j]);
}
}
int index =L[m][n];
char lcs[index+1];
lcs[index]='\0';
int i=m,j=n;
while(i>0 && j>0)
{
if(X[i-1]==Y[j-1])
{
lcs[index-1]=X[i-1];
i--;
j--;
index--;
}
else if (L[i-1][j] > L[i][j-1])
i--;
else
j--;
}
cout<<"LCS of "<<X<<" and "<<Y<<" : "<<lcs<<endl;;
}
int main()
{
char X[20],Y[20];
cout<<"Enter the first sequence :";
cin.getline(X,20);
cout<<"Enter the second sequence :";
cin.getline(Y,20);
int m=strlen(X);
int n=strlen(Y);
LCS(X,Y,m,n);
return 0;
}