Package g0101_0200.s0152_maximum_product_subarray

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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.

    The test cases are generated so 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:

    • <code>1 <= nums.length <= 2 * 10<sup>4</sup></code>

    • -10 &lt;= nums[i] &lt;= 10

    • The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxProduct(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait