class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0, k = 1, zero = 0;
        for(int l=0, h =0; h<nums.length; h++)
        {
            if(nums[h]==0)
                zero++;
            while(zero > k)
                if(nums[l++]==0)
                    zero--;
            max = Math.max(max, h-l+1);
        }
        return max;
    }
}