Given an integer array nums, find a contiguous non-empty subarray that has the largest product and return that product.
Examples
Input: nums = [2,3,-2,4] Output: 6
Input: nums = [-2,0,-1] Output: 0
Constraints
- 1 <= nums.length <= 2 * 10^4
- -10 <= nums[i] <= 10