class Solution {
public int rob(int[] nums) {
if(nums.length == 0 || nums == null){
return 0;
}
if(nums.length == 1){
return nums[0];
}
int len = nums.length;
return Math.max(robCiecle(nums, 0, len-1), robCiecle(nums, 1, len));
}
public int robCiecle(int[] nums, int start, int end){
int x = 0, y = 0, z = 0;
for(int i = start; i < end; i++){
x = y;
y = z;
z = Math.max(y, x + nums[i]);
}
return z;
}
}