added code for longest common subsequence #90
Conversation
|
okay adding
|
done at #94 |
|
It will be now be reviewed manually. Thanks for contributions. If you have more concerns, you may get the conversation started at our discord server |
|
|
||
|
|
||
| /* | ||
|
|
||
| Time Complexity - O(n*m) | ||
| product of length of two strings | ||
|
|
||
| Space Complexity -O(n*m) | ||
| product of length of two strings | ||
|
|
||
| Algorithm - Dynamic Programming (by using dynamic programing keep storing the length of longest common subsequence(lcs) for every continuous part of string1 for the whole string2.) | ||
|
|
||
|
|
||
| */ |
There was a problem hiding this comment.
Remove useless white-spaces from everywhere
| int n=text1.length()+1; | ||
| int m=text2.length()+1; | ||
| vector<vector<int>>lcs(n,vector<int>(m,0)); | ||
| for(int i=n-2;i>=0;i--) | ||
| { | ||
| for(int j=m-2;j>=0;j--) | ||
| { | ||
| if(text1[i]==text2[j]) | ||
| { | ||
| lcs[i][j]=lcs[i+1][j+1]+1; | ||
| } | ||
| else | ||
| { | ||
| lcs[i][j]=max(lcs[i+1][j],lcs[i][j+1]); | ||
| } | ||
| } | ||
| } | ||
| return lcs[0][0]; | ||
| } |
There was a problem hiding this comment.
Add some concise comments as well, because we want the code to be quite beginner-friendly, i.e., understandable from reading only
|
|
||
|
|
||
|
|
|
It will be now be reviewed manually. Thanks for contributions. If you have more concerns, you may get the conversation started at our discord server |
Longest Common Subsequence #78
added c++ code for longest common subsequence.