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.

算法思路：与House Robber I 问题不同的是，房间的排列呈环形，这意味着第0个房间和第n-1个房间相邻，所以，我们只需考虑这个问题，其他问题上一个题目已经解决了，有问题参考博客。我们只需求出[0…n-2]的最大值和 [1…n-1] 的最大值，返回这两个的最大值。

参考代码：

//213. House Robber II  动态规划  自下向上 
    public int rob4(int[] nums) {
    	int len = nums.length;
    	if(len == 0)
    		return 0;
    	if(len == 1)
    		return nums[0];
    	int[] memo = new int[len];
    	//考虑偷取 [0...x]范围的房子 （函数的定义）
    	memo[0] = nums[0];
    	for(int i=1;i<len-1;i++){
			int max = 0;
			for (int j = i; j >= 0; j--) {
				max = Math.max(nums[j] + ((j - 2) < 0 ? 0 : memo[j - 2]), max);
			}
			memo[i] = max;
    	}
    	int a= memo[len-2];
    	// 考虑偷取 [1...x]范围的房子 
    	memo[1] = nums[1];
    	for(int i=2;i<len;i++){
    		int max = 0;
    		for(int j=i;j>=1;j--){
    			max = Math.max(nums[j] + ((j - 2) < 1 ? 0 : memo[j - 2]), max);
    		}
    		memo[i] = max;
    	}
    	int b = memo[len-1];
		return a>b ? a : b;
    }