DynamicProgrammingStriver/HouseRobber2Lecture6.cpp at main · dhruvkej9/DynamicProgrammingStriver · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <iostream>
#include <vector>
// L5 Space optimization solution
using namespace std;
long long int maximumNonAdjacentSum(vector<int> &nums)
{
    int n = nums.size();
    long long int prev = nums[0];
    long long int prev2 = 0;
    for(int i=1;i<n;i++)
    {
        long long int take = nums[i];
        if(i>1) take += prev2;

        long long int nottake = 0 + prev;

        long long int curi = max(nottake,take);
        prev2 = prev;
        prev = curi;
    }
    return prev;
}
long long int houseRobber(vector<int>& valueInHouse)
{
    vector<int> temp1,temp2;
    int n = valueInHouse.size();
    if(n == 1) return valueInHouse[0];
    for(int i = 0;i < n;i++)
    {
        if(i != 0) temp1.push_back(valueInHouse[i]);
        if(i != n-1) temp2.push_back(valueInHouse[i]);
    }
    return max(maximumNonAdjacentSum(temp1),maximumNonAdjacentSum(temp2));
}