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.

分析：house robber的升级版，从原来的一个数组到一个圆环，区别就是第一个元素与最后一个元素相邻，即第一个元素与最后一个元素不能同时被选中。

处理方法：按照原来的方法，先计算从第一个元素到倒数第二个元素，然后计算从第二个元素到最后一个元素，取二者的最大值。

AC代码如下：

  int rob(vector<int>& nums) 
    {
        //特殊情况考虑，数组为空、1、2的情形
        if(nums.empty())
            return 0;
        int n = nums.size();
        if(n == 1)
            return nums[0];
        if(n == 2)
            return max(nums[0],nums[1]);
        //从第一个到倒数第二个
        int prepre1 = 0;
        int pre1 = nums[0];
        int cur1 = nums[0];
        for(int i = 1;i < n-1;i++)
        {
            cur1 = max(prepre1 + nums[i],pre1);
            prepre1 = pre1;
            pre1 = cur1;
        }
        //从第二个到最后一个
        int prepre2 = 0;
        int pre2 = nums[1];
        int cur2 = nums[1];
        for(int i =2;i<n;i++)
        {
            cur2 = max(prepre2 + nums[i],pre2);
            prepre2 = pre2;
            pre2 = cur2;
        }
        return max(cur1,cur2);
    }