LeetCode|Maximum Product Subarray

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(vector<int>& nums) {
        if(nums.size() == 0) return 0;
        int curMin = nums[0], curMax = curMin, res = curMin, tmin, tmax;
        for(int i = 1; i < nums.size(); ++i){
            tmax = curMax*nums[i]; tmin = curMin*nums[i];
            curMax = max(max(nums[i], tmax), tmin);
            curMin = min(min(nums[i], tmax), tmin);
            res = max(curMax, res);
        } return res;
    }
};