LeetCode: Max Consecutive Ones III Solution

Approach

Maintain a window of k zeros at most

Calculate max whenever on every window's size changed

Implementation

1/**
2 * @param {number[]} nums
3 * @param {number} k
4 * @return {number}
5 */
6var longestOnes = function (nums, k) {
7  let [res, numberOfZeros, left] = [0, 0, 0]
8
9  for (let right = 0; right < nums.length; right++) {
10    if (nums[right] === 0) {
11      numberOfZeros++
12    }
13
14    if (numberOfZeros > k) {
15      while (numberOfZeros > k) {
16        if (nums[left] === 0) {
17          numberOfZeros--
18        }
19        left++
20      }
21    }
22
23    // think when left = 0, right = 0, the length should be 1
24    res = Math.max(res, right - left + 1)
25  }
26
27  return res
28}