LeetCode 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.

public class Solution {
    public int rob(int[] nums) {
        int length;
        if (nums == null || (length = nums.length) == 0) {
            return 0;
        }
        if (length == 1) {
            return nums[0];
        }
        if (length == 2) {
            return Math.max(nums[0],nums[1]);
        }
        //抢第一家就不能抢最后一家，反之。
        return Math.max(rob(nums,0,length-1),rob(nums,1,length));
    }

    public int rob(int[] nums,int low, int high) {
        if (high - low <= 1) {
            return nums[low];
        }
        int[] dp = new int[high];
        dp[low] = nums[low];
        dp[low+1] = Math.max(nums[low], nums[low + 1]);
        for (int i = low + 2; i < high; i++) {
            dp[i] = Math.max(dp[i-1],dp[i-2]+nums[i]);
        }
        return dp[high-1];

    }
}