Maximum Product Subarray
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.
code
class Solution {
public:
int maxProduct(vector<int>& nums) {
if (nums.size()==0)
{
return 0;
}
if (nums.size() ==1)
{
return nums[0];
}
int curMax = nums[0];
int curMin = nums[0];
int res = nums[0];
for (int i = 1; i < nums.size(); i++)
{
int temp = curMin*nums[i];
curMin = min(nums[i], min(temp, curMax*nums[i]));
curMax = max(nums[i], max(temp, curMax*nums[i]));
res = max(res, curMax);
}
return res;
}
};