Skip to content

Added All The File Of Longest Common Subsequence #37

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
IIdroyII merged 1 commit into from
Oct 14, 2021
Merged

Added All The File Of Longest Common Subsequence #37

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions LongestCommonSubsequence.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
#include <iostream>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;

//finding max value
int max(int a, int b)
{
return (a > b) ? a : b;
}

//finding LCS
int LongestCommonSubsequence(char *str1, char *str2, int x, int y)
{
if (x == 0 || y == 0)
{
return 0;
}
if (str1[x - 1] == str2[y - 1])
{
return (1 + LongestCommonSubsequence(str1, str2, x - 1, y - 1));
}
else
{
return max(LongestCommonSubsequence(str1, str2, x, y - 1), LongestCommonSubsequence(str1, str2, x - 1, y));
}
}

//main function
int main()
{
char str1[] = "cantonment";
char str2[] = "longatone";
int x = strlen(str1);
int y = strlen(str2);
cout << "\nLength of Longest Common Subsequence From Both The Strings Is " << LongestCommonSubsequence(str1, str2, x, y) << endl;
return 0;
}