[Leetcode]152. Maximum Product Subarray

煮茶听雪

于 2016-07-21 20:04:25 发布

阅读量275

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/sunhero2010/article/details/51986199

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种寻找数组中具有最大乘积的连续子数组的方法。通过动态规划技巧，算法能在O(n)的时间复杂度内解决问题。示例中使用了{2,3,-2,4}

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],

the contiguous subarray [2,3] has the largest product = 6.

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int maxPre = nums[0];
        int minPre = nums[0];
        int maxPro = nums[0];
        int minCur;
        int maxCur;
        for (int i = 1; i < nums.size(); ++i) {
            maxCur = max(max(minPre * nums[i], maxPre * nums[i]), nums[i]);
            minCur = min(min(minPre * nums[i], maxPre * nums[i]), nums[i]);
            maxPro = max(maxPro, maxCur);
            minPre = minCur;
            maxPre = maxCur;
        }
        return maxPro;
    }
};