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

Update house_robber.cpp

Browse Source
This commit is contained in:
Swastika Gupta
2021-07-04 08:38:50 +05:30
committed by GitHub
parent 67fa9f6082
commit cdf701c2a8
1 changed files with 4 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
dynamic_programming/house_robber.cpp
View File

@@ -34,27 +34,14 @@ std::uint64_t houseRobber(const std::vector<int> &money, int n) {
if (n == 1) { // if there is only one house if (n == 1) { // if there is only one house
return money[0]; return money[0];
} }
if (n == 2) { // if there are two houses, one with the maximum amount of if (n == 2) { // if there are two houses, one with the maximum amount of money will be robbed
// money will be robbed return std::max(money[0],money[1]);
if (money[0] > money[1]) {
return money[0];
}
return money[1];
} }
int max_value = 0; // contains maximum stolen value at the end int max_value = 0; // contains maximum stolen value at the end
int value1 = money[0]; int value1 = money[0];
int value2 = 0; int value2 = std::max(money[0],money[1]);
if (money[0] > money[1]) {
value2 = money[0];
} else {
value2 = money[1];
}
for (int i = 2; i < n; i++) { for (int i = 2; i < n; i++) {
if (money[i] + value1 > value2) { max_value = std::max(money[i]+value1,value2);
max_value = (money[i] + value1);
} else {
max_value = (value2);
}
value1 = value2; value1 = value2;
value2 = max_value; value2 = max_value;
} }
@@ -89,7 +76,6 @@ static void test() {
// third, fifth and seventh with total sum money as 19 // third, fifth and seventh with total sum money as 19
std::cout << "passed" << std::endl; std::cout << "passed" << std::endl;
// Test 3
// [] return 0 // [] return 0
std::vector<int> array3 = {}; std::vector<int> array3 = {};
std::cout << "Test 3... "; std::cout << "Test 3... ";