213 House Robber II

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

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 1:

Input: [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2),
             because they are adjacent houses.

Example 2:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

如果抢劫第一家，则不可以抢最后一家；否则，可以抢最后一家。因此，这个问题 就转化成为了两趟动规，可以复用 "House Robber" 的代码。

class Solution {
    public int rob(int[] nums) {
        if (nums.length == 0 || nums == null)
            return 0;
        if (nums.length == 1)
            return nums[0];
        return Math.max(rob(0, nums.length - 1, nums),
                       rob(1, nums.length, nums));
    }
    
    private int rob(int begin, int end, int[] nums) {
        if (begin >= end || nums == null)
            return 0;
        if ((end - begin) == 1)
            return nums[begin];
        int even = nums[begin];
        int odd = Math.max(nums[begin], nums[begin + 1]);
        
        for (int i = begin + 2; i < end; i++) {
            if ((i - begin) % 2 == 0)
                even = Math.max(odd, even + nums[i]);
            else
                odd = Math.max(even, odd + nums[i]);
        }
        return Math.max(even, odd);
    }
}