mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-04 02:56:40 +08:00
0d766b0f8a
* chore: add cache and build comment to git ignore
* fix: add cmakelists to dynamic programming
* fix: add cmakelists to greedy_algorithms
* fix: add cmakelists to operations_on_datastructures
* fix: add cmakelists to range_queries
* fix: add `dynamic_programmin`, `greedy_algorithms`, `range_queries` and `operations_on_datastructures` subdirectories to cmakelists.txt
* fix: init of transform_reduce in dynamic_programming
* fix: add an include for functional in catalan_numbers
* chore: bump CXX standard to 20
* revert: bump CXX standard to 20
* chore: bump c++ version to 17 and add justification
Arm supports c++ 17
Esp32 supports c++ 23
decision was made to be 17 because it seemed to offer the best combatability
* fix: compilation error in catalan numbers
* fix: add <set> header to longest increasing subsequence nlogn
* fix: add cmath & algorithm header to mo.cpp
* fix: remove register key word from fast integer
* fix: replace using namespace std with std::cin and std::cout
* docs: typo in c++17
* fix: memory leak in bellman_ford
* fix: typo in bellman_ford
* fix: typo in word_break
* fix: dynamic array in coin_change
* fix dynamic array in egg_dropping puzzle
* chore: remove unnecessary comment
* fix: add vla to be an error
* chore: add extra warnings
* fix: use add_compile options instead of set()
* fix: compile options are not strings
* fix: vla in floyd_warshall
* fix: vla in egg_dropping_puzzel
* fix: vla in coin_change
* fix: vla in edit_distance
* fix: vla in floyd_warshall
* feat: remove kadane and replace it with kadane2
* fix: vla in longest_common_subsequence
* fix: int overflow in floyd_warshall
* fix: vla in lisnlogn
* fix: use const vector& instead of array
* fix: use dynamic array instead of vla in knapsack
* fix: use of and in msvc is unsupported by default adding permissive flag fixes it
* test: make executables the tests themselves
* Revert "test: make executables the tests themselves"
This reverts commit 7a16c31c4e.
* fix: make dist constant in print
* fix: namespace issue in unbounded_0_1
* fix: include cstdint to fix compilation
67 lines
1.8 KiB
C++
67 lines
1.8 KiB
C++
// Longest common subsequence - Dynamic Programming
|
|
#include <iostream>
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
void Print(int trace[20][20], int m, int n, string a) {
|
|
if (m == 0 || n == 0) {
|
|
return;
|
|
}
|
|
if (trace[m][n] == 1) {
|
|
Print(trace, m - 1, n - 1, a);
|
|
cout << a[m - 1];
|
|
} else if (trace[m][n] == 2) {
|
|
Print(trace, m - 1, n, a);
|
|
} else if (trace[m][n] == 3) {
|
|
Print(trace, m, n - 1, a);
|
|
}
|
|
}
|
|
|
|
int lcs(string a, string b) {
|
|
int m = a.length(), n = b.length();
|
|
std::vector<std::vector<int> > res(m + 1, std::vector<int>(n + 1));
|
|
int trace[20][20];
|
|
|
|
// fills up the arrays with zeros.
|
|
for (int i = 0; i < m + 1; i++) {
|
|
for (int j = 0; j < n + 1; j++) {
|
|
res[i][j] = 0;
|
|
trace[i][j] = 0;
|
|
}
|
|
}
|
|
|
|
for (int i = 0; i < m + 1; ++i) {
|
|
for (int j = 0; j < n + 1; ++j) {
|
|
if (i == 0 || j == 0) {
|
|
res[i][j] = 0;
|
|
trace[i][j] = 0;
|
|
}
|
|
|
|
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.
|
|
} 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.
|
|
} else {
|
|
res[i][j] = res[i][j - 1];
|
|
trace[i][j] =
|
|
3; // means trace the matrix in left direction.
|
|
}
|
|
}
|
|
}
|
|
}
|
|
Print(trace, m, n, a);
|
|
return res[m][n];
|
|
}
|
|
|
|
int main() {
|
|
string a, b;
|
|
cin >> a >> b;
|
|
cout << lcs(a, b);
|
|
return 0;
|
|
}
|