213. House Robber II

Difficulty: Medium

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 size=nums.size();
        if(size==0) return 0;
        else if(size==1) return nums[0];
        else if(size==2) return max(nums[0], nums[1]);
        vector<int> dp(size, 0);
        int max1=0, max2=0;
        //the last house unrobbed
        dp[0]=nums[0];
        dp[1]=max(nums[0], nums[1]);
        for(int i=2; i<size-1; i++){
            dp[i]=max(dp[i-1], dp[i-2]+nums[i]);
        }
        max1=max(dp[size-2], dp[size-3]);
        //the last house robbed
        dp[1]=nums[1];
        dp[2]=max(nums[1], nums[2]);
        for(int i=3; i<size; i++){
            dp[i]=max(dp[i-1], dp[i-2]+nums[i]);
        }
        max2=max(dp[size-1], dp[size-2]);
        return max(max1, max2);
    }
};

dp[i]: max money for i...k
DP: dp[i]=max{nums[i]+dp[i-1], nums[i]+dp[i-2]}

与198题不同的是这次房子连成一个圈，那么分2种情况。

1. 抢劫最后一个房子，计算直接不考虑第一个房子。

2. 不抢劫最后一个房子，计算直接不考虑最后一个房子。