class Solution {
public int maxProduct(int[] nums) {
int n = nums.length;
int[] max = new int[n];
int[] min = new int[n];
max[0] = nums[0];
min[0] = nums[0];
int count = nums[0];
for(int i = 1;i < n;i++){
max[i] = Math.max(Math.max(nums[i],max[i - 1] * nums[i]),min[i - 1] * nums[i]);
min[i] = Math.min(Math.min(nums[i],min[i - 1] * nums[i]),max[i - 1] * nums[i]);
count = Math.max(count,max[i]);
}
return count;
}
}
力扣最大连续子数组乘积
最新推荐文章于 2023-09-13 10:15:53 发布