LeetCode 198 House Robber

LeetCode 198 House Robber

动态规划 beat100%

memo[i]表示抢【i，n-1】最大收益

memo[i]=max(memo[i],nums[j]+(j+2<n?memo[j+2]:0));

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