Leetcode-198_ House Robber-典型动态规划-【C++】

198. House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

题目大意：

你是一名专业的强盗，计划抢劫沿街的房屋。每间房屋都藏有一定数量的金钱，唯一阻止你抢劫每间房屋的限制因素是邻近的房屋有保安系统连接，如果在同一晚上有两间相邻的房屋被闯入，它将自动与警方联系。

给出一份代表每个房屋的金额的非负整数列表，确定你可以在没有提醒警方的情况下抢劫的最高金额。

解题思路：

简单的动态规划就可解了

class Solution {
public:
    int res;
    vector<int> memo;
    int tryRob(vector<int>& nums,int index){
        if(index>=nums.size())
            return res;

        if(memo[index]!=-1)
            return memo[index];
        res = -1;
        for(int i=0;i<index;i++){
            res = max(memo[i],nums[i]+tryRob(nums,index+1));
        }
        memo[index] = res;

    }

    int rob(vector<int>& nums) {
        int n = nums.size();
        memo=vector<int>(n,-1);
        tryRob(nums,0); 
    }
};

结果：3ms