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 a 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
nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
Input: nums = [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.
Input: nums = [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.
Input: nums =  Output: 0
1 <= nums.length <= 100
0 <= nums[i] <= 1000
The solution in Java code
An Alternate View at the Acceptance Criteria
If we take the first example and say that:
Input: nums = [2,3,2] Output: 4 Explanation: You can rob house 1 (money = 2) and rob house 3 (money = 2), because they are NOT adjacent houses. As they have house 2 (money = 3) inbetween them.
If we take this new viewpoint, then we can write the following code to resolve the problem: