152. Maximum Product Subarray（图解）

Super_Whw

于 2020-10-02 09:22:09 发布

阅读量112

点赞数 1

分类专栏： Leetcode Favorate [图解]

本文链接：https://blog.csdn.net/weixin_42939835/article/details/108854470

版权

Leetcode Favorate [图解] 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

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.

Solution

C++

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int res = nums[0];
        int Max = res, Min = res;
        for(int i = 1; i < nums.size(); ++i) {
            if(nums[i] < 0) swap(Min, Max);
            Max = max(Max*nums[i],nums[i]);
            Min = min(Min*nums[i],nums[i]);
            res = max(Max, res);
        }
        return res;
    }
};