House robber II

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.

Example

Example1

Input:  nums = [3,6,4]
Output: 6

Example2

Input:  nums = [2,3,2,3]
Output: 6

Notice

This is an extension of House Robber.

思路：形成环形了，跟上一题的区别就是要注意头和尾，头偷了，尾巴就不能偷。

那么如果我们把环形拉直，也就是一个circuler array，也就是说主要点就是在头和尾巴，中间都一样。

那么我们可以算假设偷头和不偷头两种情况的最大值，

那么就是 偷：1~n-1

不偷：2~n

分别计算两种情况的下的值，然后取最大，返回就可以。

class Solution {
    public int rob(int[] nums) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        int n = nums.length;
        if(n == 1) {
            return nums[0];
        }
        // left;
        int[] left = new int[n - 1];
        left[0] = nums[0];
        for(int i = 1; i < left.length; i++) {
            // not pickup;
            left[i] = left[i - 1];
            
            // pick up;
            if(i - 2 >= 0) {
                left[i] = Math.max(left[i], nums[i] + left[i - 2]);
            } else {
                left[i] = Math.max(left[i], nums[i]);
            }
        }
        
        // right;
        int[] right = new int[n - 1];
        right[0] = nums[1];
        for(int i = 1; i < right.length; i++) {
            // not pickup;
            right[i] = right[i - 1];
            
            // pick up;
            if(i - 2 >= 0) {
                right[i] = Math.max(right[i], nums[i + 1] + right[i - 2]);
            } else {
                right[i] = Math.max(right[i], nums[i + 1]);
            }
        }
        
        return Math.max(left[n - 2], right[n - 2]);
    }
}