class Solution {
public int maxProduct(int[] nums) {
int max = nums[0];
int min = nums[0];
int res = nums[0];
for(int i = 1; i < nums.length; i++){
int temp = max;
max = Math.max(Math.max(max*nums[i], min*nums[i]), nums[i]);
min = Math.min(Math.min(temp*nums[i], min*nums[i]), nums[i]);
res = Math.max(max, res);
}
return res;
}
}
Python
class Solution:
def maxProduct(self, nums: List[int]) -> int:
res = max(nums)
curMin, curMax = 1, 1
for n in nums:
if n == 0:
curMin, curMax = 1, 1 # if meet 0, reset the curMin, curMax
continue
tmp = curMax * n
curMax = max(tmp, n * curMin, n)
curMin = min(tmp, n * curMin, n)
res = max(res, curMax)
return res
