class Solution {public:    int rob(vector
    
     & nums) {        if (nums.size() == 0){            return 0;        }        if (nums.size() == 1){            return nums[0];        }        if (nums.size() == 2){            return max(nums[0], nums[1]);        }        vector
     
       income;        income.push_back(nums[0]);        income.push_back(max(nums[0], nums[1]));        for (int i = 2; i < nums.size(); ++i){            income.push_back(max(income[i-1], income[i-2] + nums[i]));        }        return income[income.size() - 1];    }};