LeetCode in Kotlin
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
Solution
class Solution {
fun getMaxLen(nums: IntArray): Int {
var posLen = 0
var negLen = 0
var res = 0
for (num in nums) {
if (num == 0) {
posLen = 0
negLen = 0
} else if (num > 0) {
posLen++
negLen = if (negLen == 0) 0 else negLen + 1
} else {
val temp = posLen
posLen = if (negLen == 0) 0 else negLen + 1
negLen = temp + 1
}
res = Math.max(res, posLen)
}
return res
}
}