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.
    Example 2:
    
    Input: [2,7,9,3,1]
    Output: 12
    Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
                 Total amount you can rob = 2 + 9 + 1 = 12.

思路： 
    题目的意思就是有一个数组，你不能选择数组里两个相邻的元素，求出你能选择的最大值。
    用a[i]表示包含第i个元素的最大值。那么这个最大值可以是a[i-1]，也可以是max(a[i-2],a[i-3])+nums[i].因为a[i-2],a[i-3]都可以选择，但是a[i-4]肯定不行，既然可以选a[i-4]，那么a[i-2]肯定可以并且a[i-2]肯定大于a[i-4]。然后判断一下边界条件和初始化一些值就可以了。

 int rob(vector<int>& nums) {
        if(nums.empty())
        {
            return 0;
        }
        if(nums.size() ==1)
            return nums[0];
        if(nums.size() ==2)
            return max(nums[0],nums[1]);
        if(nums.size() ==3)
            return max(nums[0]+nums[2],nums[1]);
        int a[nums.size()];
        
        a[0] = nums[0];
        a[1] = nums[1];
        a[2] = nums[2] + a[0];
        for(int i = 3;i<nums.size();i++)
        {
            a[i] = max(nums[i] + max(a[i-2],a[i-3]),a[i-1]);
        }
        return a[nums.size()-1];
    }