1493. Longest Subarray of 1's After Deleting One Element (Leetcode)

class Solution {
    public int longestSubarray(int[] nums) {
        int current = 0;
        int previous = 0;
        int max = 0;
        
        for(int i = 0; i < nums.length; i++) {
            
            if(nums[i] == 1) {
                current++;
            } else {
                max = Math.max(max, (current + previous));
                previous = current;
                current = 0;
            }
        }

        if(nums[nums.length - 1] == 1) {
            max = Math.max(max, (current + previous));
        } 

        if(max == nums.length) max--; 

        return max;
      
    }
}