leetcode house Rubber 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.

class Solution {
public:
    int rob(vector<int>& nums) {
        int l = nums.size();
        if(l<1) return 0;
        if(l==1) return nums[0];
        if(l==2) return max(nums[0],nums[1]);
        int dp1[1000];
        dp1[0] = nums[0];
        dp1[1] = max(nums[0],nums[1]);
        for(int i=2;i<l;i++){
            dp1[i] = max(dp1[i-1],dp1[i-2]+nums[i]);
        }
        int dp2[1000]; 
        dp2[1]=nums[1];
        dp2[2] = max(nums[1],nums[2]);
        for(int i=3;i<l;i++){
            dp2[i] = max(dp2[i-1],dp2[i-2]+nums[i]);
        }
        if(dp1[l-1]==dp2[l-1]){ return dp1[l-1];}//第一个数不参与运算
		else if(dp1[l-1]==dp1[l-2]){return dp1[l-1];}//第一个数参与运算且第N个数不参与运算
		else //第一个数参与运算且第N个数参与运算
		{return max(dp1[l-2],dp2[l-1]);}
    }
};