Number of Ways to Split a String LeetCode solution in JavaScript

1
var numWays = function (s) {
2
  let one = 0;
3
  let list = [];
4
  for (let i = 0; i < s.length; i++) {
5
    if (s[i] === "1") one++, list.push(i);
6
  }
7
  if (one % 3 !== 0) return 0;
8
  if (one === 0) return (((s.length - 1) * (s.length - 2)) / 2) % 1000000007;
9
  one /= 3;
10
  return (
11
    ((list[one] - list[one - 1]) * (list[2 * one] - list[2 * one - 1])) %
12
    1000000007
13
  );
14
};