class Solution {
public int maxProduct(int[] nums) {
if(nums.length==0) return 0;
if(nums.length==1) return nums[0];
int localmin = nums[0];
int localmax = nums[0];
int global = nums[0];
for(int i = 1;i<nums.length;i++){
int temp = localmin;
localmin = Math.min(Math.min(localmax*nums[i],localmin*nums[i]),nums[i]);
localmax = Math.max(Math.max(localmax*nums[i],temp*nums[i]),nums[i]);
global = Math.max(global,localmax);
}
return global;
}
}
数组中最大连续区间求积
最新推荐文章于 2022-06-27 01:56:52 发布