Leetcode 152. Maximum Product Subarray (Medium) (cpp)

最新推荐文章于 2024-02-19 10:45:53 发布

Niko_Ke

最新推荐文章于 2024-02-19 10:45:53 发布

阅读量332

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52038081

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 152. Maximum Product Subarray (Medium) (cpp)

Tag: Array, Dynamic Programming

Difficulty: Medium

/*

152. Maximum Product Subarray (Medium)

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) {
		if(nums.empty()) {
            return 0;
        }
		int cur_max = nums[0], cur_min = nums[0], maxProduct = nums[0];
		for(int i = 1; i < nums.size(); i++) {
			int prev_min = cur_min, prev_max = cur_max;
			cur_max = max(nums[i], max(prev_max * nums[i], prev_min * nums[i]));
			cur_min = min(nums[i], min(prev_max * nums[i], prev_min * nums[i]));
			maxProduct = max(cur_max, maxProduct);
		}
		return maxProduct;
	}
};