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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/maximum-product-subarray
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

 

思路：

1、对于乘法，当nums[i]为负数时，当前最大值maxn*nums[i]会变成最小值

2、同时记录最小值和最大值：

当nums[i]是正值时，maxn*nums[i]，minn*nums[i]还是最大值，最小值

当nums[i]是负值时，maxn*nums[i]，minn*nums[i]变成最小值，最大值，因此当nums[i]为负值时，交换maxn和minn

3、ans记录全局最大值

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int n = nums.size();
        int maxn = nums[0], minn = nums[0], ans = nums[0];
        for(int i = 1; i < n; i++){
            if(nums[i] < 0){
                int temp = maxn;
                maxn= minn;
                minn = temp;                
            }
            maxn = max(nums[i], maxn * nums[i]); 
            minn = min(nums[i], minn * nums[i]); 
            ans = max(maxn, ans);
        }
        return ans;
    }
};