138. Maximum Product Subarray
MediumDynamic Programming
Given an integer array nums, find a subarray that has the largest product, and return the product. A subarray is a contiguous non-empty sequence of elements within an array. The test cases are generated so that the answer fits in a 32-bit integer.
Examples
Input: [2,3,-2,4]
Output: 6
Explanation: The subarray [2,3] has the largest product 6.
Constraints
- 1 <= nums.length <= 2 * 10^4
- -10 <= nums[i] <= 10
- The product of any subarray of nums is guaranteed to fit in a 32-bit integer.
Loading...
Run checks all cases above. Submit evaluates all test cases.