problem152

README

< Previous 　　　　　　　　　　　　　　　　 Next >

152. Maximum Product Subarray (Medium)

Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.

It is guaranteed that the answer will fit in a 32-bit integer.

A subarray is a contiguous subsequence of the array.

 

Example 1:

Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2:

Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

 

Constraints:

• 1 <= nums.length <= 2 * 104
• -10 <= nums[i] <= 10

Related Topics

[Array] [Dynamic Programming]

Similar Questions

1. Maximum Subarray (Easy)
2. House Robber (Medium)
3. Product of Array Except Self (Medium)
4. Maximum Product of Three Numbers (Easy)
5. Subarray Product Less Than K (Medium)