LeetCode *** 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.

分析：

一道很简单的dp题目，但是因为自己的疏忽导致做了比较久。题目要求的是不能同时抢劫相邻的人家，却被我理解成不能抢劫某家时其相邻两家不能同时被抢劫。。。难度大大提升。。。总之这道题还是很简单的，只是判断对于dp[i]只是max（dp[i-1],dp[i-2]+nums[i]）就可以了。

代码：

class Solution {
public:
    int rob(vector<int>& nums) {
        int size=nums.size();
        
        int *dp=new int[size+1];
        
        if(size==0)return 0;
        
        dp[0]=0;
        dp[1]=nums[0];
        
        for(int i=1;i<size;++i){
            dp[i+1]=max(dp[i],dp[i-1]+nums[i]);
        }
        
        return dp[size];
        
    }
private:
    int max(int a,int b){
        return a>b?a:b;
    }
};