Description
Given an integer array nums, find a subarray 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.
Examples
Input:
nums = [2,3,-2,4]Output:
6Explanation:
[2,3] has the largest product 6.
Input:
nums = [-2,0,-1]Output:
0Explanation:
The result cannot be 2, because [-2,-1] is not a contiguous subarray.
Input:
nums = [-2,3,-4]Output:
24Explanation:
Works with negative numbers.
Constraints
- •
1 ≤ nums.length ≤ 2 × 10⁴ - •
-10 ≤ nums[i] ≤ 10