Max Consecutive Ones LeetCode solution in JavaScript

1
var findMaxConsecutiveOnes = function (nums) {
2
  let count = 0;
3
  let max = 0;
4
  for (let i = 0; i < nums.length; i++) {
5
    if (nums[i] == 1) {
6
      count++;
7
    }
8
    if (nums[i] == 0 || i == nums.length - 1) {
9
      max = Math.max(count, max);
10
      count = 0;
11
    }
12
  }
13
  return max;
14
};