打家劫舍

class Solution {
public:
    int rob(vector<int>& nums) {
    int length = nums.size();
        if (nums.empty()) {
            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]);
        int res = 0;
        for(int i = 2;i < nums.size();i++){
            dp[i] = max(dp[i-1],dp[i-2] + nums[i]);
        }
        return dp[length - 1];
    }
};