OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

[test/feat]: Add self-test implementations and...

Browse Source 
...namespace (`dynamic_programming`).
Thanks to @manncodes for the idea and help!

Co-authored-by: Mann Patel <manncodes@users.noreply.github.com>
This commit is contained in:
David Leal 2021-06-08 13:11:06 -05:00
parent 2c12a592e5
commit 7d4562d6eb
No known key found for this signature in database
GPG Key ID: 3C482B03FD220E68
1 changed files with 25 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
dynamic_programming/longest_increasing_subsequence.cpp
View File

@ -11,10 +11,16 @@
* @author [David Leal](https://github.com/Panquesito7) * @author [David Leal](https://github.com/Panquesito7)
*/ */
#include <cassert> /// for assert
#include <iostream> /// for IO operations #include <iostream> /// for IO operations
#include <climits> /// for std::max #include <climits> /// for std::max
#include <vector> /// for std::vector #include <vector> /// for std::vector
/**
* @namespace dynamic_programming
* @brief Dynamic Programming algorithms
*/
namespace dynamic_programming {
/** /**
* @brief Calculate the longest increasing subsequence for the specified numbers * @brief Calculate the longest increasing subsequence for the specified numbers
* @param a the array used to calculate the longest increasing subsequence * @param a the array used to calculate the longest increasing subsequence
@ -22,7 +28,7 @@
* @returns the length of the longest increasing * @returns the length of the longest increasing
* subsequence in the `a` array of size `n` * subsequence in the `a` array of size `n`
*/ */
int LIS(const std::vector<uint64_t> &a, const uint32_t &n) { uint64_t LIS(const std::vector<uint64_t> &a, const uint32_t &n) {
std::vector<int> lis(n); std::vector<int> lis(n);
for (int i = 0; i < n; ++i) { for (int i = 0; i < n; ++i) {
lis[i] = 1; lis[i] = 1;
@ -39,6 +45,21 @@ int LIS(const std::vector<uint64_t> &a, const uint32_t &n) {
} }
return res; return res;
} }
} // namespace dynamic_programming
/**
* @brief Self-test implementations
* @returns void
*/
static void test(){
std::vector<uint64_t> a = {15,21,2,3,4,5,8,4,1,1};
uint32_t n = a.size();
uint32_t result = dynamic_programming::LIS(a, n);
assert(result == 5); ///< The longest increasing subsequence is `{2,3,4,5,8}`
std::cout << "Self-test implementations passed!" << std::endl;
}
/** /**
* @brief Main function * @brief Main function
@ -59,6 +80,8 @@ int main(int argc, char const *argv[]) {
std::cin >> a[i]; std::cin >> a[i];
} }
std::cout << "The result is: " << LIS(a, n) << std::endl; std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n) << std::endl;
test(); // run self-test implementations
return 0; return 0;
} }