std::uint32_t
houseRobber(
conststd::vector<uint32_t> &money,
46 returnstd::max(money[0], money[1]);
48uint32_t max_value = 0;
49uint32_t value1 = money[0];
50uint32_t value2 = std::max(money[0], money[1]);
51 for(uint32_t i = 2; i < n; i++) {
52max_value = std::max(money[i] + value1, value2);
69std::vector<uint32_t> array1 = {1, 2, 3, 1};
70std::cout <<
"Test 1... ";
75std::cout <<
"passed"<< std::endl;
79std::vector<uint32_t> array2 = {6, 7, 1, 3, 8, 2, 4};
80std::cout <<
"Test 2... ";
85std::cout <<
"passed"<< std::endl;
89std::vector<uint32_t> array3 = {};
90std::cout <<
"Test 3... ";
94std::cout <<
"passed"<< std::endl;
98std::vector<uint32_t> array4 = {2, 7, 9, 3, 1};
99std::cout <<
"Test 4... ";
104std::cout <<
"passed"<< std::endl;
std::uint32_t houseRobber(const std::vector< uint32_t > &money, const uint32_t &n)
The main function that implements the House Robber algorithm using dynamic programming.
static void test()
Self-test implementations.
int main()
Main function.
Dynamic Programming algorithms.
Functions for the House Robber algorithm.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4