# 152. Maximum Product Subarray

#### Medium

***

Given an integer array `nums`, find a contiguous non-empty subarray within the array that has the largest product, and return *the product*.

The test cases are generated so that the answer will fit in a **32-bit** integer.

A **subarray** is a contiguous subsequence of the array.

 

**Example 1:**

```
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
```

**Example 2:**

```
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
```

 

**Constraints:**

* `1 <= nums.length <= 2 * 104`
* `-10 <= nums[i] <= 10`
* The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.

```python
class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        maximum = nums[0]
        minimum = nums[0]
        max_of_all = nums[0]
        nums.pop(0)
        for num in nums:
            temp = max(num, num*maximum, num*minimum)
            minimum = min(num , num*maximum, num*minimum)
            maximum = temp
            max_of_all = max(max_of_all, maximum)
        return max_of_all
            
        
        
```