152. 乘積最大子數組 - 力扣（LeetCode）

class Solution:def maxProduct(self, nums: List[int]) -> int:if not nums:return 0max_prod = nums[0]min_prod = nums[0]result = nums[0]for i in range(1, len(nums)):if nums[i] < 0:max_prod, min_prod = min_prod, max_prod  # 交換，處理負數的情況max_prod = max(nums[i], max_prod * nums[i])min_prod = min(nums[i], min_prod * nums[i])result = max(result, max_prod)return result