lec10_11.cpp

class Solution {
    public:
        int rob(vector<int>& nums) {
            
            int n = nums.size();
            int prev = nums[0];
            int prev2 = 0 ;
    
            for(int i = 1 ; i<n;i++)
            {
                int take = nums[i];
                if(i>1) take+=prev2;
    
                int notTake = 0 +prev;
    
                int curri = max(take , notTake);
                prev2 = prev;
                prev = curri;
            }
    
            return prev;
        }
    };