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

这道题是第198题的升级版，和第198题相比，新的街道所有房子首尾相连形成一个环形，题目难度为Medium。

有了第198题的基础，我们知道，如果偷了第一个房子就不能偷最后一个房子，这样相当于求第一个到倒数第二个房子能偷到的最大钱数；如果不偷第一个房子就可以偷最后一个房子，这样相当于求第二个到最后一个房子能偷到的最大钱数。至此就把题目转化为了第198题的情况，只需要取两者中大的那个就可以了。具体代码：

class Solution {
    int robHouse(const vector<int>& nums, int bgn, int end) {
        int money1 = 0, money2 = 0, money3 = 0;
        for(int i=bgn; i<end; i++) {
            money3 = max(money2, money1+nums[i]);
            money1 = money2;
            money2 = money3;
        }
        return money3;
    }
public:
    int rob(vector<int>& nums) {
        if(nums.empty()) return 0;
        if(nums.size() == 1) return nums[0];
        return max(robHouse(nums, 0, nums.size()-1), robHouse(nums, 1, nums.size()));
    }
};