works/solutions/leetcode/cpp/198.cpp


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

#include <vector>

using std::vector;

class Solution
{
public:
    int rob(vector<int> &nums)
    {
        int count = nums.size();
        if (count == 0)
            return 0;

        int not_rob_prev = 0;
        int rob_prev = nums.front();

        for (int i = 1; i < count; i++)
        {
            int not_rob_prev_cache = not_rob_prev;
            not_rob_prev = std::max(not_rob_prev_cache, rob_prev);
            rob_prev = std::max(not_rob_prev_cache + nums[i], not_rob_prev);
        }

        return rob_prev;
    }
};