<p>Given an array of integers <code>nums</code>, find the maximum length of a subarray where the product of all its elements is positive.</p>

<p>A subarray of an array is a consecutive sequence of zero or more values taken out of that array.</p>

<p>Return <em>the maximum length of a subarray with positive product</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,-2,-3,4]
<strong>Output:</strong> 4
<strong>Explanation:</strong> The array nums already has a positive product of 24.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,-2,-3,-4]
<strong>Output:</strong> 3
<strong>Explanation:</strong> 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&#39;ll make the product 0 which is not positive.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1,-2,-3,0,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> The longest subarray with positive product is [-1,-2] or [-2,-3].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def getMaxLen(self, nums: List[int]) -> int:

        # def arrayProduct:

        maxLen = 0
        nextStart = 0
        leftGap = 0
        rightGap = 0
        lastNeg = -1
        negatives = 0
        for i, num in enumerate(nums):
            if num < 0:
                negatives += 1
                if negatives == 1:
                    leftGap = i - nextStart + 1
                lastNeg = i
            if num == 0:
                # Process subarray
                # print(nums[nextStart:i])
                if negatives > 0 and negatives % 2 != 0:
                    # print(lastNeg)
                    # print(i)
                    rightGap = i - lastNeg
                # print(leftGap)
                # print(rightGap)
                # print(nums[nextStart:i])
                subMax = i - nextStart - min(leftGap, rightGap)
                maxLen = max(maxLen, subMax)
                nextStart = i + 1
                leftGap = 0
                rightGap = 0
                lastNeg = -1
                negatives = 0
        i = len(nums)
        if negatives > 0 and negatives % 2 != 0:
            rightGap = i - lastNeg
        # print(leftGap)
        # print(rightGap)
        # print(nums[nextStart:i])
        subMax = i - nextStart - min(leftGap, rightGap)
        maxLen = max(maxLen, subMax)
        nextStart = i + 1
        leftGap = 0
        rightGap = 0
        lastNeg = -1
        negatives = 0
        return maxLen

404