backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
dynamic_programming/longest_common_subsequence.cpp
View File

@@ -1,4 +1,4 @@
//Longest common subsequence - Dynamic Programming
// Longest common subsequence - Dynamic Programming
#include <iostream>
using namespace std;
@@ -52,19 +52,22 @@ int lcs(string a, string b)
else if (a[i - 1] == b[j - 1])
{
res[i][j] = 1 + res[i - 1][j - 1];
trace[i][j] = 1; // 1 means trace the matrix in upper left diagonal direction.
trace[i][j] = 1; // 1 means trace the matrix in upper left
// diagonal direction.
}
else
{
if (res[i - 1][j] > res[i][j - 1])
{
res[i][j] = res[i - 1][j];
trace[i][j] = 2; // 2 means trace the matrix in upwards direction.
trace[i][j] =
2; // 2 means trace the matrix in upwards direction.
}
else
{
res[i][j] = res[i][j - 1];
trace[i][j] = 3; // means trace the matrix in left direction.
trace[i][j] =
3; // means trace the matrix in left direction.
}
}
}