House Robber II---lintcode

Description

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
nums = [3,6,4], return 6

这个是House Robber的拓展题。就是数组变成循环的了。有点像循环链表。

思路过程：因为是循环的，第一个和最后一个元素不能同时偷，所以我想创建一个数组isFirst记录temp是否有第一个元素。有为True，没有为false. temp的下标和isFirst下标一一对应。当循环到最后一个元素的时候，从isFirst数组中找到倒数两个为false的下标a,b。同时比较temp[a]和temp[b].将较大的跟nums[i]相加 变为temp[i].
按道理这个思路 没问题。只是我的能力有问题。当测试运行到70%的时候 就出错了。卡在这个数据
[81,112,609,341,164,601,97,709,944,828,627,730,460,523,643,901,
602,508,401,442,738,443,555,471,97,644,184,964,418,492,920,897,
99,711,916,178,189,202,72,692,86,716,588,297,512,605,209,100,
107,938,246,251,921,767,825,133,465,224,807,455,179,436,201,842,
325,694,132,891,973,107,284,203,272,538,137,248,329,234,175,108,
745,708,453,101,823,937,639,485,524,660,873,367,153,191,756,162,
50,267,166,996,552,675,383,615,985,339,868,393,178,932]

这么长，恶心死了。调试半天 没找到 问题。。果断放弃。

网上搜索了一下，有这样一个思路：
因为第一个element 和最后一个element不能同时出现. 则分两次call House Robber I. case 1: 不包括最后一个element. case 2: 不包括第一个element.两者的最大值即为全局最大值

public class Solution {  
    //1 2 3  
    public int rob(int[] nums) {  
        if(nums==null || nums.length==0) return 0;  
        if(nums.length==1) return nums[0];  
        if(nums.length==2) return Math.max(nums[0], nums[1]);  
        return Math.max(robsub(nums, 0, nums.length-2), robsub(nums, 1, nums.length-1));  
    }  

    private int robsub(int[] nums, int s, int e) {  
        int n = e - s + 1;  
        int[] d =new int[n];  
        d[0] = nums[s];  
        d[1] = Math.max(nums[s], nums[s+1]);  

        for(int i=2; i<n; i++) {  
            d[i] = Math.max(d[i-2]+nums[s+i], d[i-1]);  
        }  
        return d[n-1];  
    }  
}  

参考网址：http://blog.csdn.net/xudli/article/details/45886721