[leetcode] 213. House Robber II

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.

解法一：

既然收尾相接，那么第一个和最后一个不能同时被打劫。所以，我们分别把第一个和最后一个element去掉，算他们的打劫值，取最大。

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