backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 19:17:21 +08:00
Code Issues Projects Releases Wiki Activity

fix: vla in longest_common_subsequence

Browse Source
This commit is contained in:
realstealthninja
2024-10-04 20:25:25 +05:30
parent 2b278e9618
commit a0abcbe496
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
dynamic_programming/longest_common_subsequence.cpp
View File

@@ -1,5 +1,6 @@
// Longest common subsequence - Dynamic Programming // Longest common subsequence - Dynamic Programming
#include <iostream> #include <iostream>
#include <vector>
using namespace std; using namespace std;
void Print(int trace[20][20], int m, int n, string a) { void Print(int trace[20][20], int m, int n, string a) {
@@ -18,7 +19,7 @@ void Print(int trace[20][20], int m, int n, string a) {
int lcs(string a, string b) { int lcs(string a, string b) {
int m = a.length(), n = b.length(); int m = a.length(), n = b.length();
int res[m + 1][n + 1]; std::vector<std::vector<int> > res(m + 1, std::vector<int>(n + 1));
int trace[20][20]; int trace[20][20];
// fills up the arrays with zeros. // fills up the arrays with zeros.