Consecutive Characters LeetCode solution in JavaScript

1
var maxPower = function (s) {
2
  let count = 1;
3
  let maxNum = 1;
4

5
  for (let i = 0; i < s.length; i++) {
6
    s[i] === s[Number(i) + 1] ? count++ : (count = 1);
7
    maxNum = Math.max(count, maxNum);
8
  }
9

10
  return maxNum;
11
};