Maximum Product Subarray
Given an integer array `nums`, find the contiguous non-empty subarray with the largest product and return that product.
Examples
in: nums = [2,3,-2,4]
out: 6
[2,3]
in: nums = [-2,0,-1]
out: 0
best is 0
Constraints
- 1 <= len(nums) <= 2*10^4
- -10 <= nums[i] <= 10
Hints