Longer Contiguous Segments of Ones than Zeros LeetCode solution in JavaScript

1
var checkZeroOnes = function (s) {
2
  let longest1 = 0;
3
  let longest0 = 0;
4

5
  let count1 = 0;
6
  let count0 = 0;
7

8
  for (let i = 0; i < s.length; i++) {
9
    const bit = s.charAt(i);
10

11
    if (bit === "1") count1++;
12
    else count1 = 0;
13

14
    if (bit === "0") count0++;
15
    else count0 = 0;
16

17
    longest1 = Math.max(longest1, count1);
18
    longest0 = Math.max(longest0, count0);
19
  }
20

21
  return longest1 > longest0;
22
};