Package g1501_1600.s1567_maximum_length_of_subarray_with_positive_product

Class Solution

java.lang.Object

g1501_1600.s1567_maximum_length_of_subarray_with_positive_product.Solution

public class Solution
extends Object

1567 - Maximum Length of Subarray With Positive Product\. Medium Given an array of integers `nums`, find the maximum length of a subarray where the product of all its elements is positive. A subarray of an array is a consecutive sequence of zero or more values taken out of that array. Return _the maximum length of a subarray with positive product_. **Example 1:** **Input:** nums = [1,-2,-3,4] **Output:** 4 **Explanation:** The array nums already has a positive product of 24. **Example 2:** **Input:** nums = [0,1,-2,-3,-4] **Output:** 3 **Explanation:** The longest subarray with positive product is [1,-2,-3] which has a product of 6. Notice that we cannot include 0 in the subarray since that'll make the product 0 which is not positive. **Example 3:** **Input:** nums = [-1,-2,-3,0,1] **Output:** 2 **Explanation:** The longest subarray with positive product is [-1,-2] or [-2,-3]. **Constraints:** * 1 <= nums.length <= 105 * -109 <= nums[i] <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	getMaxLen(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

getMaxLen

public int getMaxLen(int[] nums)