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.

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

public int rob(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];
        int robNo = 0, robYes = nums[0];
        for (int i = 1; i < nums.length - 1; i++) {
            int temp = robNo;
            robNo = Math.max(robNo, robYes);
            robYes = temp + nums[i];
        }
        int ans = Math.max(robNo, robYes);
         robNo = 0;
         robYes = nums[1];
        for (int i = 2; i < nums.length; i++) {
            int temp = robNo;
            robNo = Math.max(robNo, robYes);
            robYes = temp + nums[i];
        }
        ans = Math.max(Math.max(robNo, robYes), ans);
        return ans;
        
    }