Maximum product subarray

Javascript

let maxProduct = (nums) => {
	let n = nums.length;
	let l = 1;
	let r = 1;
	let ans = nums[0];
	for (let i = 0 ; i < n; i++) {
		l = l == 0 ? 1 : l;
		r = r == 0 ? 1 : r;
		l *= nums[i];
		r *= nums[n-1-i];
		ans = Math.max(ans, Math.max(l, r));
	}
	return ans;
}
 
let arr = [1, 4, -1, 5, 9, -2];