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
题目链接:https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/
题目大意:求最长的积为正数的子数组的长度
题目分析:只需记录到当前数字所能组成的正数和负数的长度即可,遇到0清零
4ms,时间击败77.8%
class Solution {
public int getMaxLen(int[] nums) {
int negCnt = 0, posCnt = 0, ans = 0;
for (int num : nums) {
if (num == 0) {
negCnt = 0;
posCnt = 0;
} else if (num > 0) {
// postive * postive = positive
posCnt++;
// negative * postive = negative
negCnt = negCnt == 0 ? 0 : negCnt + 1;
} else {
int preNeg = negCnt;
// postive * negative = negative
negCnt = posCnt + 1;
// negative * negative = positive
posCnt = preNeg == 0 ? 0 : preNeg + 1;
}
ans = Math.max(ans, posCnt);
}
return ans;
}
}