#1567
Maximum Length of Subarray With Positive Product
specialist · 945 · lc medium +32 · verified · 44.6% accepted · 2,491 likes · top 27%
Description
Given an integer array nums, find the length of the longest contiguous subarray whose product of all elements is strictly positive. A subarray is a contiguous sequence of elements. Return the maximum length of such a subarray.
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].
Code
1
2
3