[LeetCode 解题报告]152. Maximum Product Subarray

最新推荐文章于 2021-07-20 07:16:11 发布

caicaiatnbu

最新推荐文章于 2021-07-20 07:16:11 发布

阅读量134

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/104134970

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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.empty())
            return 0;
        
        int res = nums[0], mx = res, mn = res;
        for (int i = 1; i < nums.size(); i ++) {
            if (nums[i] < 0)
                swap(mx, mn);
            mx = max(nums[i]*mx, nums[i]);
            mn = min(nums[i]*mn, nums[i]);
            res = max(res, mx);
        }
        return res;
    }
};