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.

Example 1:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

给定一个非负数组，从中取出若干元素，且各个元素不能相邻，求其取出元素的最大和。

这道题是一道典型的动态规划题，dp[i] = max(dp[i-1], dp[i-2] + nums[i])，类似斐波那契数列，博主并不想浪费多余的O(n)，因此最终代码如下，几乎和斐波那契数列一致。

class Solution {
public:
    int rob(vector<int>& nums) {
        int pre = 0, cur = 0;
        for(int i = 0; i < nums.size(); i++)
        {
            int tmp = cur;
            cur = max(cur, pre + nums[i]);
            pre = tmp;
        }
        return cur;
    }
};