Merge pull request #37 from code08-ind/new-branch

IIdroyII · web-flow · commit e9b34e752bd3 · 2021-10-15T01:26:20.000+05:30
Added All The File Of Longest Common Subsequence
diff --git a/LongestCommonSubsequence.cpp b/LongestCommonSubsequence.cpp
@@ -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;
+}
