198. House Robber （Easy）

原题目：
　　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.

题目大意如下：
　　你是一个非常职业的抢劫犯，现在让你去抢一条街上的一些房子。每一栋房子都存有一定的钱，唯一的约束是你不能抢两个相邻的房子，因为这样会触发报警。现在要你求出一个抢劫方案，要求得到的钱数量最多但不触发报警。

解题思路：
　　 动态规划。
　　 状态转移方程：
　　 Max[i] = max(nums[i] + Max[i-2] , Max[i-1])
　　 其中Max[i]代表从左到右到第i家的时候可以抢劫得到的最多钱。

代码如下：

class Solution {
public:
    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]) ;
        int Max[nums.size()] ;
        Max[0] = nums[0] ;
        Max[1] = max(nums[0] , nums[1]) ;
        Max[2] = max(nums[0] + nums[2] , nums[1]) ;
        for(int i = 3 ; i < nums.size() ; ++i)
            Max[i] = max(nums[i] + Max[i-2] , Max[i-1]) ;
        return Max[nums.size()-1] ;
    }
};

算法分析：
　　一维的动态规划：O(n)。