Maximum Product Subarray

最新推荐文章于 2019-12-26 03:55:28 发布

真水壶

最新推荐文章于 2019-12-26 03:55:28 发布

阅读量363

点赞数

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

本文链接：https://blog.csdn.net/enjoyuseless/article/details/39671075

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

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(int A[],int n)
	{
		int ret=A[0];
		vector<int> maxValue(n,0);
		vector<int> minValue(n,0);
		for(int i=0;i<n;i++)
		{
			if(i==0)
			{
				maxValue[i]=minValue[i]=A[i];
			}
			else
			{
				minValue[i]=min(A[i],min(A[i]*maxValue[i-1],A[i]*minValue[i-1]));
				maxValue[i]=max(A[i],max(A[i]*maxValue[i-1],A[i]*minValue[i-1]));
				ret=max(ret,maxValue[i]);
			}
		}
		return ret;
	}
};