Maximum Product Subarray LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number}
4
 */
5
var maxProduct = function (nums) {
6
  const n = nums.length - 1;
7
  let ans = nums[0];
8
  let l = 1,
9
    r = 1;
10

11
  for (let i = 0; i < nums.length; i++) {
12
    l = (l ? l : 1) * nums[i];
13
    r = (r ? r : 1) * nums[n - i];
14
    ans = Math.max(ans, Math.max(l, r));
15
  }
16

17
  return ans;
18
};