Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example 1:

Input: [2,3,-2,4]

Output: 6

Explanation: [2,3] has the largest product 6.

Example 2:

Input: [-2,0,-1]

Output: 0

Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

class Solution(object):    def maxProduct(self, nums):        """        :type nums: List[int]        :rtype: int        """        large = small = nums[0]        res = nums[0]        for i in range(1,len(nums)):            temp = large            large = max(nums[i],large * nums[i],small * nums[i])            small = min(nums[i],small * nums[i],temp * nums[i])            res = max(large,res)        return res