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.

分析：

环形dp。

代码：

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