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
int maxProduct(int* nums, int numsSize) {
if(numsSize==0)
return 0;
int min=nums[0],max=nums[0],res=nums[0],min_copy,i;
for(i=1;i<numsSize;i++)
{
if(nums[i]>0)
{
max=nums[i]>nums[i]*max?nums[i]:nums[i]*max;
min=nums[i]<nums[i]*min?nums[i]:nums[i]*min;
}
else
{
min_copy=min;
min=nums[i]<max*nums[i]?nums[i]:max*nums[i];
max=nums[i]>min_copy*nums[i]?nums[i]:min_copy*nums[i];
}
res=max>res?max:res;
}
return res;
}