MAXIMUM PRODUCT SUBARRAY

https://leetcode.com/problems/maximum-product-subarray/submissions/

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        max_so_far=max(nums)
        current_max=current_min=1
        for num in nums:
            temp=current_max
            current_max=max(current_max*num,current_min*num,num)
            current_min=min(current_min*num,temp*num,num)
            max_so_far=max(current_max,max_so_far)
        return max_so_far