198. House Robber.cpp

class Solution {
public:
int solve(vector<int>&nums,int index,vector<int>&dp){
    if(index>=nums.size()) return 0;

    if(dp[index]!=-1) return dp[index];
    int include=0,notInclude=0;

    include=nums[index]+solve(nums,index+2,dp);
    notInclude=solve(nums,index+1,dp);
    return dp[index]=max(include,notInclude);
}
    int rob(vector<int>& nums) {
        vector<int>dp(nums.size(),-1);
        return solve(nums,0,dp);
    }
};