asdf.java

class Solution {
    public int rob(int[] nums) {
        if(nums.length == 0) { return 0; }
        
        int takeA = nums[0], leaveA = 0, takeB = 0, leaveB = 0;
        
        for(int i = 1; i < nums.length; i++) {
            int tmpTakeA = takeA, tmpLeaveA = leaveA, tmpTakeB = takeB, tmpLeaveB = leaveB;
            
            takeA = (i == nums.length - 1) ? 0 : tmpLeaveA + nums[i];
            leaveA = Math.max(tmpTakeA, tmpLeaveA);
            
            takeB = tmpLeaveB + nums[i];
            leaveB = Math.max(tmpTakeB, tmpLeaveB);
        }
        return Math.max(Math.max(takeA, leaveA),
                        Math.max(takeB, leaveB));
    }
}