1 class Solution {
 2 public:
 3     int rob(vector<int>& nums) {
 4         int size = nums.size();
 5        vector<int> dp(size+1);
 6 
 7        dp[0] = 0;
 8        dp[1] = nums[0];
 9 
10        if(size==1) return nums[0];
11 
12        for(int i = 2;i<=size;i++){
13            dp[i] = max(dp[i-2]+nums[i-1],dp[i-1]);
14        }
15 
16        return dp[size];
17     }
18 };