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

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

Difficulty:Medium

仔细想一下，和 I 比无非三种情况：

1. 进第一个房子，不进最后一个房子

2. 不进第一个房子，进最后一个房子

3. 第一个房子最后一个房子都不进

这样就变成了House Robber I的问题

class Solution {
public:

    int rob2(vector<int>& nums) {
        int len = nums.size();
        if(len==0)
           return 0;
        if(len==1)
           return nums[0];
        if(len==2)
           return max(nums[0],nums[1]);
        if(len>=4)
           nums[3] = max(max(nums[0]+nums[2],nums[1]+nums[3]),nums[0]+nums[3]);
        if(len>=3)
           nums[2] = max(nums[0]+nums[2],nums[1]);
        
        for(int i = 4;i<len;i++)
            nums[i] = max(nums[i]+nums[i-2],nums[i-1]);
        
        return max(nums[len-1],nums[len-2]);
    }

    int rob(vector<int>& nums) {
        int len = nums.size();
        
        if(len==0)
           return 0;
        if(len==1)
           return nums[0];
        if(len==2)
           return max(nums[0],nums[1]);
        if(len==3)
           return max(max(nums[0],nums[1]),nums[2]);
        if(len==4)
           return max(nums[0]+nums[2],nums[1]+nums[3]);
        vector<int> nums2 = nums; 
        
        int ans = 0;
        
        nums2[0] = 0;
        ans = max(rob2(nums2),ans);
    
        nums2 = nums;
        nums2[len-1] = 0;
        ans = max(rob2(nums2),ans);
        
        nums2 = nums;
        nums2[len-1] = 0;
        nums2[0] = 0;
        ans = max(rob2(nums2),ans);
        
        return ans;
        
    }
};