LeetCode-in-All
152. Maximum Product Subarray
Medium
Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bit integer.
A subarray is a contiguous subsequence of the array.
Example 1:
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
Constraints:
1 <= nums.length <= 2 * 104-10 <= nums[i] <= 10- The product of any prefix or suffix of
numsis guaranteed to fit in a 32-bit integer.
Solution
/**
* @param {number[]} nums
* @return {number}
*/
var maxProduct = function(nums) {
let overAllMaxProd = Number.MIN_SAFE_INTEGER
let n = nums.length
let start = 1
let end = 1
for (let i = 0; i < n; i++) {
if (start === 0) {
start = 1
}
if (end === 0) {
end = 1
}
start *= nums[i]
end *= nums[n - i - 1]
overAllMaxProd = Math.max(overAllMaxProd, Math.max(start, end))
}
return overAllMaxProd
};
export { maxProduct }