Leetcode 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.

根据题意得要获取连续的最大乘积和。这道题的做法是维护两个变量maxNum,minNum.因为对于数组而言， 每个元素乘以最大值有可能变成最小值， 乘以最小值也有可能变为最大值。代码如下

public int maxProduct(int[] nums) {
        int minNum=nums[0];
        int maxNum=nums[0];
        int res=nums[0];
        for(int i=1;i<nums.length;i++)
        {
             int a = Math.min(minNum*nums[i], maxNum * nums[i]);
             int b = Math.max(minNum * nums[i], maxNum * nums[i]);
             minNum = Math.min(nums[i], a);
             maxNum = Math.max(nums[i], b);
             res = Math.max(res, maxNum);
        }
        return res; 
    }