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

clang-format and clang-tidy fixes for c00823e8

Browse Source
This commit is contained in:
github-actions
2021-07-04 03:02:49 +00:00
parent c00823e8db
commit 67fa9f6082
1 changed files with 47 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

83
dynamic_programming/house_robber.cpp
View File

@@ -2,12 +2,13 @@
* @file
* @brief Implementation of [House Robber Problem] algorithm
* @details
* Solution of House robber problem uses a dynamic programming concept that works in \f$O(n)\f$ time and works in \f$O(1)\f$ space.
* Solution of House robber problem uses a dynamic programming concept that
* works in \f$O(n)\f$ time and works in \f$O(1)\f$ space.
*/
#include <cassert> /// for assert
#include <iostream> /// for io operations
#include <vector> /// for std::vector
#include <cassert> /// for assert
#include <iostream> /// for io operations
#include <vector> /// for std::vector
/**
* @namespace dynamic_programming
@@ -20,45 +21,44 @@ namespace dynamic_programming {
*/
namespace house_robber {
/**
* @brief The main function implements house robber algorithm using dynamic programming
* @brief The main function implements house robber algorithm using dynamic
* programming
* @param money array containing money in the ith house
* @param n size of array
* @returns maximum amount of money that can be robbed
*/
std::uint64_t houseRobber(const std::vector<int> &money, int n) {
if (n == 0) { // if there is no house
return 0;
if (n == 0) { // if there is no house
return 0;
}
if (n == 1) { // if there is only one house
return money[0];
}
if (n == 2) { // if there are two houses, one with the maximum amount of money will be robbed
if (money[0] > money[1]) {
if (n == 1) { // if there is only one house
return money[0];
}
return money[1];
}
int max_value; // contains maximum stolen value at the end
if (n == 2) { // if there are two houses, one with the maximum amount of
// money will be robbed
if (money[0] > money[1]) {
return money[0];
}
return money[1];
}
int max_value = 0; // contains maximum stolen value at the end
int value1 = money[0];
int value2;
int value2 = 0;
if (money[0] > money[1]) {
value2 = money[0];
}
else{
} else {
value2 = money[1];
}
for (int i=2; i<n; i++) {
if (money[i]+value1 > value2) {
max_value = (money[i]+value1);
}
else{
max_value = (value2);
}
value1 = value2;
value2 = max_value;
for (int i = 2; i < n; i++) {
if (money[i] + value1 > value2) {
max_value = (money[i] + value1);
} else {
max_value = (value2);
}
value1 = value2;
value2 = max_value;
}
return max_value;
}
} // namespace house_robber
@@ -69,31 +69,42 @@ std::uint64_t houseRobber(const std::vector<int> &money, int n) {
* @returns void
*/
static void test() {
//Test 1
// Test 1
// [1, 2, 3, 1] return 4
std::vector<int> array1 = {1, 2, 3, 1};
std::cout << "Test 1... ";
assert(dynamic_programming::house_robber::houseRobber(array1,array1.size())==4); // here the two non-adjacent houses that are robbed are first and third with total sum money as 4
assert(
dynamic_programming::house_robber::houseRobber(array1, array1.size()) ==
4); // here the two non-adjacent houses that are robbed are first and
// third with total sum money as 4
std::cout << "passed" << std::endl;
// Test 2
// [6, 7, 1, 3, 8, 2, 4] return 19
std::vector<int> array2 = {6, 7, 1, 3, 8, 2, 4};
std::cout << "Test 2... ";
assert(dynamic_programming::house_robber::houseRobber(array2,array2.size())==19); // here the four non-adjacent houses that are robbed are first, third, fifth and seventh with total sum money as 19
assert(
dynamic_programming::house_robber::houseRobber(array2, array2.size()) ==
19); // here the four non-adjacent houses that are robbed are first,
// third, fifth and seventh with total sum money as 19
std::cout << "passed" << std::endl;
// Test 3
// Test 3
// [] return 0
std::vector<int> array3 = {};
std::cout << "Test 3... ";
assert(dynamic_programming::house_robber::houseRobber(array3,array3.size())==0); // since there is no house no money can be robbed
assert(
dynamic_programming::house_robber::houseRobber(array3, array3.size()) ==
0); // since there is no house no money can be robbed
std::cout << "passed" << std::endl;
// [2,7,9,3,1] return 12
std::vector<int> array4 = {2,7,9,3,1};
std::vector<int> array4 = {2, 7, 9, 3, 1};
std::cout << "Test 4... ";
assert(dynamic_programming::house_robber::houseRobber(array4,array4.size())==12); // here the three non-adjacent houses that are robbed are first, third and fifth with total sum money as 12
assert(
dynamic_programming::house_robber::houseRobber(array4, array4.size()) ==
12); // here the three non-adjacent houses that are robbed are first,
// third and fifth with total sum money as 12
std::cout << "passed" << std::endl;
}