算法设计Week8 LeetCode Algorithms Problem #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.

---

题目分析：

题目中提到如果闯入相邻两房间就会激活报警器，这就意味这题目的限制是不能同时抢相邻两间房的金钱。也就是说，如果取房间i的钱，那么房间i-1和i+1的钱都不可以取。
假设nums[i]表示第i个房间的钱数，sum[i]表示一定要抢第i个房间，前面i个房间一共能抢到的钱数。
这样，可以得到下面的递推式：
sum[i] = max(sum[i - 2] + sum[i - 3]) + nums[i]
对于n个房间最多可以得到的钱数，为：max(sum[n], sum[n - 1])。
代码如下，时间复杂度为$O(n)$，空间复杂度为$O(n)$：

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