Fixing C++ from Longest Common Subsequence (#554)

* removing cpp broken code

* Fixing cpp code.

Co-authored-by: Sifat <[email protected]>

Algorithms/Dynamic Programming/Longest Common Subsequence/README.md

@@ -126,19 +126,13 @@ int main() {
 
 ```
 
-
-## C++ 
-
+## CPP
 ```cpp
-// C++ Program for longest common subsequence
-
 #include <iostream>
+#include <cstring>
 using namespace std;
-
 void lcsAlgo(char *S1, char *S2, int m, int n) {
   int LCS_table[m + 1][n + 1];
-
-
   // Building the mtrix in bottom-up way
   for (int i = 0; i <= m; i++) {
     for (int j = 0; j <= n; j++) {
@@ -150,11 +144,9 @@ void lcsAlgo(char *S1, char *S2, int m, int n) {
         LCS_table[i][j] = max(LCS_table[i - 1][j], LCS_table[i][j - 1]);
     }
   }
-
   int index = LCS_table[m][n];
   char lcsAlgo[index + 1];
   lcsAlgo[index] = '\0';
-
   int i = m, j = n;
   while (i > 0 && j > 0) {
     if (S1[i - 1] == S2[j - 1]) {
@@ -163,7 +155,6 @@ void lcsAlgo(char *S1, char *S2, int m, int n) {
       j--;
       index--;
     }
-
     else if (LCS_table[i - 1][j] > LCS_table[i][j - 1])
       i--;
     else
@@ -173,13 +164,11 @@ void lcsAlgo(char *S1, char *S2, int m, int n) {
   // Printing the sub sequences
   cout << "S1 : " << S1 << "\nS2 : " << S2 << "\nLCS: " << lcsAlgo << "\n";
 }
-
 int main() {
   char S1[] = "ACDABCD";
   char S2[] = "ADBCA";
   int m = strlen(S1);
   int n = strlen(S2);
-
   lcsAlgo(S1, S2, m, n);
 }