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.
It is guaranteed 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
function maxProduct(nums: number[]): number {
let cMin = 1
let cMax = 1
let max = nums[0]
for (const num of nums) {
let tempMin = cMin
cMin = Math.min(cMax * num, cMin * num, num)
cMax = Math.max(cMax * num, tempMin * num, num)
max = Math.max(max, cMax)
}
return max
}
export { maxProduct }