1
class Solution {
2
public:
3
    int rob(vector<int>& nums) {
4
        int n = nums.size();
5
        vector<int> money(n + 1);
6

7
        if (n == 1) {
8

9
            money[0] = nums[0];
10
            return money[0];
11

12
        } else if (n == 2) {
13
            money[1] = max(nums[0], nums[1]);
14
            return money[1];
15
        } else {
16
             money[0] = nums[0];
17
             money[1] = max(nums[0], nums[1]);
18
            for (int i = 2; i < n; i++)
19
                money[i] = max(money[i - 2] + nums[i], money[i - 1]);
20
        }
21
        return money[n - 1];
22
    }
23
};