213. House Robber II(unsolved)

Note: This is an extension of House Robber.

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.

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.

解答：

这道题可以这样考虑。由于首尾相连，第一个数和最后一个数是不能同时取的。那么分别考虑只有第一个数没有最后一个和只有最后一个数没有第一个数的情况。然后取最大的。调用House Robber I 的做法就行，注意接口有left和right作为取值范围

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


    }
};