Maximum Product Subarray
Medium
Topics
Given an integer array nums, find a contiguous non-empty subarray that has the largest product, and return the product.
Example 1
Input: nums = [2,3,-2,4] Output: 6
Example 2
Input: nums = [-2,0,-1] Output: 0
Constraints
- 1 <= nums.length <= 2*10^4
- -10 <= nums[i] <= 10
- Answer fits in a 32-bit integer.
Run ⌘' · Submit ⌘⏎
SensAI