[LC] 152. Maximum Product Subarray

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

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.

class Solution {
    public int maxProduct(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int max = nums[0];
        int min = nums[0];
        int res = nums[0];
        int preMax = max;
        for (int i = 1; i < nums.length; i++) {
            // include the current for comparison
            max = Math.max(nums[i], Math.max(preMax * nums[i], min * nums[i]));
            min = Math.min(nums[i], Math.min(min * nums[i], preMax * nums[i]));
            res = Math.max(max, res);
            preMax = max;
        }
        return res;
    }
}