152. Maximum Product Subarray

[Tcdian]

152. Maximum Product Subarray

给你一个整数数组 nums ，请你找出数组中乘积最大的连续子数组（该子数组中至少包含一个数字），并返回该子数组所对应的乘积。

Example 1

Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2

Input: [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

[Tcdian]

Solution

• JavaScript Solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxProduct = function(nums) {
    let result = -Infinity;
    let maxProduct = 1;
    let minProduct = 1;
    for(let i = 0; i < nums.length; i++) {
        let prevMaxProduct = maxProduct;
        let prevMinProduct = minProduct;
        maxProduct = Math.max(prevMaxProduct * nums[i], prevMinProduct * nums[i], nums[i]);
        minProduct = Math.min(prevMaxProduct * nums[i], prevMinProduct * nums[i], nums[i]);
        result = Math.max(maxProduct, result);
    }
    return result;
};