Maximum Nesting Depth of Two Valid Parentheses Strings LeetCode solution in JavaScript

1
/**
2
 * @param {string} seq
3
 * @return {number[]}
4
 */
5
var maxDepthAfterSplit = function (seq) {
6
  let arr = [];
7
  for (let i = 0; i < seq.length; i++) {
8
    arr.push(seq[i] == "(" ? i & 1 : (1 - i) & 1);
9
  }
10
  return arr;
11
};