class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int longestSequence = 0;
        
        int left = 0;
        int right = 0;
        
        int numZeroes = 0;

        while (right < nums.length) {

            // add the right most element into our window
            if (nums[right] == 0) {
                numZeroes++;
            }

            // if our window is invalid, contract our window
            while (numZeroes == 2) {
                if (nums[left] == 0) {
                    numZeroes--;
                }
                left++;
            }

            // update our longest sequence answer
            longestSequence = Math.max(longestSequence, right - left + 1);

            // expand our window
            right++;
        }
        
        return longestSequence;
    }
}

class Solution {
    
    public int findMaxConsecutiveOnes(int[] nums) {
        int longestSequence = 0;
        
        for (int left = 0; left < nums.length; left++) {
            int numZeroes = 0;

            // check every consecutive sequence
            for (int right = left; right < nums.length; right++) {
                // count how many 0's
                if (nums[right] == 0) {
                    numZeroes += 1;
                }
                // # update answer if it's valid
                if (numZeroes <= 1) {
                    longestSequence = Math.max(longestSequence, right - left + 1);
                }
            }
        }
        
        return longestSequence;
    }
}