Given an integer array
nums, find a subarray (A subarray is a contiguous non-empty sequence of elements within an 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.
Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6.
Input: nums = [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
1 <= nums.length <= 2 * 104
-10 <= nums[i] <= 10
- The product of any prefix or suffix of
numsis guaranteed to fit in a 32-bit integer.
Record both "max" and "min" up to the number