Python leetcode 152. Maximum Product Subarray

class Solution(object):
    def maxProduct(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        maxval = float('-inf')
        imax = 1
        imin = 1
        for i in range(len(nums)):
            if nums[i]<0:
                imax, imin = imin, imax
            imax = max(imax*nums[i], nums[i])
            imin = min(imin*nums[i], nums[i])
            maxval = max(maxval, imax)
        return maxval