[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.
题意：
一个强盗去抢劫钱，但是不能抢劫连着的住户的钱。
找出能够抢到最多钱的方法。
思路：
对于抢劫第i户人家，如果地i－1户被打劫了，那么第i次就不能去打劫了，所以我们可以把问题分解成前i－1次打劫的总钱数（可能包括了第i－1户人家），以及前i－2次打劫的总钱数（肯定不包括第i－1户人家）前i次的总钱数就是：
max（money［i-1], money[i-2] + nums[i]);
以上所述。
代码如下：

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