Skip to content

Added C++ Solution for 9th chapter #146

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Oct 30, 2019
Merged

Added C++ Solution for 9th chapter #146

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
4493e29
Added C++ Solution for 9th chapter
OleksandrDanylchenko Aug 12, 2019
7b32a26
Fixed extra space
OleksandrDanylchenko Aug 12, 2019
dcf9b3f
Fixed another extra space
OleksandrDanylchenko Aug 13, 2019
e253aa1
Output style correction
OleksandrDanylchenko Aug 13, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 43 additions & 0 deletions 09_dynamic_programming/с++/01_longest_common_subsequence
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
#include <iostream>
#include <algorithm>

int main() {
std::string wordA = "Fish", wordB = "Fosh";
const size_t& aSize = wordA.size(), &bSize = wordB.size();

size_t** table = new size_t* [aSize];
for (size_t l = 0; l < aSize; ++l)
table[l] = new size_t[bSize]{}; // all values in table will be initialized as zero

for (size_t i = 0; i < aSize; ++i)
for (size_t j = 0; j < bSize; ++j)
if (wordA[i] == wordB[j])
if (i > 0 && j > 0)
table[i][j] = table[i - 1][j - 1] + 1;
else
table[i][j] = 1;
else
if (i > 0 && j > 0)
table[i][j] = std::max(table[i - 1][j], table[i][j - 1]);
else if (i == 0 && j > 0)
table[i][j] = table[i][j - 1];
else if (i > 0 && j == 0)
table[i][j] = table[i - 1][j];
else
table[i][j] = 0;

for (size_t i = 0; i < aSize; ++i) {
std::cout << "[ ";
for (size_t j = 0; j < bSize; ++j)
std::cout << table[i][j] << ' ';
std::cout << ']' << std::endl;
}

// [1 1 1 1]
// [1 1 1 1]
// [1 1 2 2]
// [1 1 2 3]

system("pause");
return 0;
}