/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var longestOnes = function(nums, k) {
    var left = 0;
    var right = 0;
    var zeroes = 0;
    var max = 0;
    while(right < nums.length - 1){
        var next = nums[right + 1];
        if(right-left > max){
            max = right-left;
            console.log(left, right, zeroes)
        }
        if(next == 1){
            right++;
        }
        else{
            if(zeroes < k){
                right++;
                zeroes++;
            }
            else{
                left++;
                if(nums[left-1] == 0){
                    zeroes--;
                }
            }
        }

    }
    return max;
};