LeetCode 0152 - Maximum Product Subarray

Reck Zhang

发布于 2021-08-11 14:48:34

2180

发布于 2021-08-11 14:48:34

文章被收录于专栏：Reck Zhang

Maximum Product Subarray

Desicription

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

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-02，如有侵权请联系 cloudcommunity@tencent.com 删除

integer