152. 乘积最大子数组 - 力扣（LeetCode）

大佬图示：

代码

# encoding = utf-8
# 开发者：Alen
# 开发时间： 21:37 
# "Stay hungry，stay foolish."

class Solution(object):
    def maxProduct(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = max(nums)
        curMin, curMax = 1, 1

        for n in nums:
            if n == 0:
                curMin, curMax = 1, 1
                continue
            temp = n * curMax # 防止提前修改的curMax污染curMin
            curMax = max(n * curMax, n * curMin, n)
            curMin = min(temp, n * curMin, n)
            res = max(res, curMax)
        return res
num = Solution().maxProduct([-4,-3,-2])
print(num)

结果

解题步骤：