leetcode198-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.

简化：给你一个非负数组，不能让相邻的两个数相加，怎样取得最大和？

问题求解：

动态规划求解。例如给出数组为：nums[]={5,4,… ,9,7,2,8},分析如下：

nums : 5 4 ...  9   7   2   8
index: 0 1 .....  i-2  i-1  i

sum[i]表示nums[0]~nums[i]之间的数得到的最大和。不难得出：

sum[0] = nums[0];
sum[1] = max(nums[0],nums[1]);
sum[i]=max(sum[i-2]+nums[i], sum[i-1]);//！！！

代码如下：

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