23-maximum-product-subarray.py

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
                continue
            tmp = curMax * n
            curMax = max(n*curMin, n*curMax, n)
            curMin = min(tmp, n*curMin, n)
            res = max(res,curMax)
        return res