Leetcode•Mar 19, 2025
152. Maximum Product Subarray
Hazrat Ali
Leetcode
Given an integer array nums, find a 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.
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 subarray of
numsis guaranteed to fit in a 32-bit integer.
Solution :
/**
* @param {number[]} nums
* @return {number}
*/
const maxProduct = nums => {
let res = nums[0];
let min = nums[0];
let max = nums[0];
for (let i = 1; i < nums.length; i++) {
if (nums[i] > 0) {
max = Math.max(nums[i], max * nums[i]);
min = Math.min(nums[i], min * nums[i]);
} else {
const tmp = max;
max = Math.max(nums[i], min * nums[i]);
min = Math.min(nums[i], tmp * nums[i]);
}
res = Math.max(res, max);
}
return res;
};