leetcode 152 - Maximum Product Subarray

class Solution(object):
    def maxProduct(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        max_product = nums[0]
        min_product = nums[0]       
        ans = nums[0]
        
        for i in range(1, len(nums)):
            min_val = min_product*nums[i]
            max_val = max_product*nums[i]
            
            max_product = max(min_val, nums[i], max_val)
            min_product = min(min_val, nums[i], max_val) 
            ans = max(ans, max_product)
        
        return ans