198_house-robber.cpp

//
// Created by 71401 on 2021/4/15.
//
class Solution {
public:
    int rob(vector<int>& nums) {
        if (!nums.size()) return 0;
        int size = nums.size();
        if (size == 1) return nums[0];
        vector<int> dp = vector<int>(size,0);
        dp[0] = nums[0];
        dp[1] = max(nums[0], nums[1]);
        for (int i = 2; i < size; ++i) {
            dp[i] = max(dp[i-2] + nums[i], dp[i-1]);
        }
        return dp[size - 1];
    }
};