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.

思路：定义一个vector MaxMoney表示存前i个房子的最大钱数。然后
MaxMoney[i]= max(MaxMoney[i-1],MaxMoney[i-2]+nums[i]);

因为当前最大值只考虑两种情况，包括或者不包括nums[i]，不包括则是选取前i-1位置的最大值，包括则选取前i-2的最大值。

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