-
Notifications
You must be signed in to change notification settings - Fork 0
/
001_LongestCommonSubsequence.cpp
51 lines (48 loc) · 1 KB
/
001_LongestCommonSubsequence.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
/*
Date : 09/02/2023
!Difficulty : Average
Interest : High
!Needs revision : YES
*/
#include <bits/stdc++.h>
using namespace std;
int LongestSubSeq(string s1, string s2)
{
int len1, len2;
len1 = s1.length();
len2 = s2.length();
int LCS[len1 + 1][len2 + 1];
for (int i = 0; i <= len1; i++)
{
LCS[i][0] = 0;
}
for (int i = 0; i <= len2; i++)
{
LCS[0][i] = 0;
}
for (int i = 1; i <= len1; i++)
{
for (int j = 1; j <= len2; j++)
{
if (s1[i - 1] == s2[j - 1])
{
LCS[i][j] = LCS[i - 1][j - 1] + 1;
}
else
{
LCS[i][j] = max(LCS[i - 1][j], LCS[i][j - 1]);
}
}
}
return LCS[len1][len2];
}
int main()
{
string s1, s2;
cout << "Enter string 1: ";
cin >> s1;
cout << "Enter string 2: ";
cin >> s2;
cout << "Longest common subsequence: " << LongestSubSeq(s1, s2) << endl;
return 0;
}