Longest Common Subsequence

altruistcoder · altruistcoder · commit bf007a06361a · 2019-08-19T14:21:41.000+05:30
diff --git a/lcs.cpp b/lcs.cpp
@@ -1,13 +1,11 @@
 #include <iostream>
 #include <string.h>
-
 using namespace std;
 
 int lcs(char x[],char y[])
 {
     int i, j, m=strlen(x), n=strlen(y), r[m+1][n+1];
     for(i=0; i<=m; i++)
-    {
         for(j=0; j<=n; j++)
         {
             if (i==0 || j==0)
@@ -17,7 +15,6 @@ int lcs(char x[],char y[])
             else
                 r[i][j] = max(r[i-1][j], r[i][j-1]);
         }
-    }
     return r[m][n];
 }
 
@@ -26,6 +23,6 @@ int main()
     char x[50], y[50];
     cout<<"Enter the two strings: ";
     cin>>x>>y;
-    cout<<"The length of the longest common subsequence is: "<<lcs(x, y);
+    cout<<"The length of the longest common subsequence is: "<<lcs(x, y)<<endl;
     return 0;
 }

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,11 @@`
`1`	`1`	`#include <iostream>`
`2`	`2`	`#include <string.h>`
`3`		`-`
`4`	`3`	`using namespace std;`
`5`	`4`
`6`	`5`	`int lcs(char x[],char y[])`
`7`	`6`	`{`
`8`	`7`	`int i, j, m=strlen(x), n=strlen(y), r[m+1][n+1];`
`9`	`8`	`for(i=0; i<=m; i++)`
`10`		`- {`
`11`	`9`	`for(j=0; j<=n; j++)`
`12`	`10`	`{`
`13`	`11`	`if (i==0 \|\| j==0)`
`@@ -17,7 +15,6 @@ int lcs(char x[],char y[])`
`17`	`15`	`else`
`18`	`16`	`r[i][j] = max(r[i-1][j], r[i][j-1]);`
`19`	`17`	`}`
`20`		`- }`
`21`	`18`	`return r[m][n];`
`22`	`19`	`}`
`23`	`20`
`@@ -26,6 +23,6 @@ int main()`
`26`	`23`	`char x[50], y[50];`
`27`	`24`	`cout<<"Enter the two strings: ";`
`28`	`25`	`cin>>x>>y;`
`29`		`- cout<<"The length of the longest common subsequence is: "<<lcs(x, y);`
	`26`	`+ cout<<"The length of the longest common subsequence is: "<<lcs(x, y)<<endl;`
`30`	`27`	`return 0;`
`31`	`28`	`}`