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

from typing import List

class Solution:
    def getMaxLen(self, nums: List[int]) -> int:
        n = len(nums)
        positive = [0] * n
        negative = [0] * n
        
        if nums[0] > 0:
            positive[0] = 1
        elif nums[0] < 0:
            negative[0] = 1
        
        max_len = positive[0]
        
        for i in range(1, n):
            if nums[i] > 0:
                positive[i] = positive[i-1] + 1
                negative[i] = negative[i-1] + 1 if negative[i-1] > 0 else 0
            elif nums[i] < 0:
                positive[i] = negative[i-1] + 1 if negative[i-1] > 0 else 0
                negative[i] = positive[i-1] + 1
            else:
                positive[i] = 0
                negative[i] = 0
            
            max_len = max(max_len, positive[i])
        
        return max_len

# Example usage:
solution = Solution()
nums = [1, -2, -3, 4]
print(solution.getMaxLen(nums))  # Output: 4
482