Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
25 changes: 25 additions & 0 deletions include/0005_DynamicProgramming/0005_HouseRobber1.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
#pragma once
#include<vector>
using namespace std;

/*
Pattern 1
Linear Recurrence

Description
There are n houses built in a line, each of which contains some money in it.
A robber wants to steal money from these houses, but he can’t steal from two adjacent houses. The task is to find the maximum amount of money which can be stolen.

*/

namespace HouseRobber1
{
class DynamicProgramming
{
private:
int MaxLootRecursive(int house, vector<int>& houseValues);
public:
int RecursiveMaximumLoot(vector<int>& houseValues);
int DpMaximumLoot(vector<int>& houseValues);
};
}
44 changes: 44 additions & 0 deletions source/0005_DynamicProgramming/0005_HouseRobber1.cc
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
#include "../../include/0005_DynamicProgramming/0005_HouseRobber1.h"

namespace HouseRobber1
{
int DynamicProgramming::MaxLootRecursive(int house, vector<int>& houseValues)
{
if (house <= 0)
{
return 0;
}

if (house == 1)
{
return houseValues[0];
}

int pickCurrentHouse = houseValues[house - 1] + this->MaxLootRecursive(house - 2, houseValues);
int dropCurrentHouse = this->MaxLootRecursive(house - 1, houseValues);

return max(pickCurrentHouse, dropCurrentHouse);
}

int DynamicProgramming::RecursiveMaximumLoot(vector<int>& houseValues)
{
int totalNumberOfHouses = houseValues.size();
return this->MaxLootRecursive(totalNumberOfHouses, houseValues);
}

int DynamicProgramming::DpMaximumLoot(vector<int>& houseValues)
{
int totalNumberOfHouses = houseValues.size();
vector<int> dp(totalNumberOfHouses + 1, 0);

dp[0] = 0;
dp[1] = houseValues[0];

for (int i = 2; i <= totalNumberOfHouses; i++)
{
dp[i] = max(dp[i - 2] + houseValues[i - 1], dp[i - 1]);
}

return dp[totalNumberOfHouses];
}
}
1 change: 1 addition & 0 deletions source/0005_DynamicProgramming/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@ set(0005DYNAMICPROGRAMMING_SOURCES
0002_TribonacciNumber.cc
0003_ClimbingStairs.cc
0004_MinimumCostClimbingStairs.cc
0005_HouseRobber1.cc

)

Expand Down
33 changes: 33 additions & 0 deletions test/0005_DynamicProgramming/0005_HouseRobber1Test.cc
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#include<gtest/gtest.h>
#include "../../include/0005_DynamicProgramming/0005_HouseRobber1.h"

namespace HouseRobber1
{
TEST(HouseRobber1, RecursionTest)
{
// Arrange
DynamicProgramming dp;
vector<int> houseValues = { 6, 7, 1, 3, 8, 2, 4 };
int expectedMaximumLoot = 19;

// Act
int actualMaximumLoot = dp.RecursiveMaximumLoot(houseValues);

// Assert
ASSERT_EQ(expectedMaximumLoot, actualMaximumLoot);
}

TEST(HouseRobber1, DpTest)
{
// Arrange
DynamicProgramming dp;
vector<int> houseValues = { 6, 7, 1, 3, 8, 2, 4 };
int expectedMaximumLoot = 19;

// Act
int actualMaximumLoot = dp.DpMaximumLoot(houseValues);

// Assert
ASSERT_EQ(expectedMaximumLoot, actualMaximumLoot);
}
}
1 change: 1 addition & 0 deletions test/0005_DynamicProgramming/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,7 @@ add_executable(
0002_TribonacciNumberTest.cc
0003_ClimbingStairsTest.cc
0004_MinimumCostClimbingStairsTest.cc
0005_HouseRobber1Test.cc

)

Expand Down
Loading