严氏北美IT公司面试真题汇总和解答论坛
Would you like to react to this message? Create an account in a few clicks or log in to continue.

Maximum Product Subarray

Go down

Maximum Product Subarray Empty Maximum Product Subarray

Post by Admin Sat Oct 21, 2017 5:01 pm

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;
}

Admin
Admin

Posts : 124
Join date : 2017-10-21

https://csinterviewquestions.forumotion.com

Back to top Go down

Back to top

- Similar topics

 
Permissions in this forum:
You cannot reply to topics in this forum