Leetcode NO.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.

本题是非常典型的动态规划的题目，我上Coursera的算法课就介绍过跟这解法一样的题目：就是WIS问题

首先是题目背景：

然后是比较重要的思路：

这个意思就是说强盗要想获得最大利益，有一个不变的原则：

偷全部n家的最优解 = 

*偷前面n-2家的最优解 + 最后一家的金额数

*偷前面n家的最优解

二者选最大的。。。按照这个思路，可以写出动态规划算法：

这个就是最后dp算法的伪代码，然后上传我的最终代码：

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