Maximum Product Subarray
Page 1 of 1
Maximum Product Subarray
public static int maxProduct(int[] nums) {
if(nums==null || nums.length==0) return 0;
if(nums.length == 1) return nums[0];
int max_local = nums[0];
int min_local = nums[0];
int ret = nums[0];
for(int i=1;i<nums.length;i++)
{
int temp = max_local;
max_local = Math.max(Math.max(nums[i]*max_local, nums[i]), nums[i]* min_local);
min_local = Math.min(Math.min(nums[i]*temp , nums[i] ), nums[i] * min_local);
ret = Math.max(ret, max_local);
}
return ret;
}
if(nums==null || nums.length==0) return 0;
if(nums.length == 1) return nums[0];
int max_local = nums[0];
int min_local = nums[0];
int ret = nums[0];
for(int i=1;i<nums.length;i++)
{
int temp = max_local;
max_local = Math.max(Math.max(nums[i]*max_local, nums[i]), nums[i]* min_local);
min_local = Math.min(Math.min(nums[i]*temp , nums[i] ), nums[i] * min_local);
ret = Math.max(ret, max_local);
}
return ret;
}
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|