mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-02-04 14:40:27 +08:00
43 lines
1.2 KiB
HTML
43 lines
1.2 KiB
HTML
|
<p>给你一个整数数组 <code>nums</code> ，请你求出乘积为正数的最长子数组的长度。</p>
|
|||
|
|
|
|||
|
|
<p>一个数组的子数组是由原数组中零个或者更多个连续数字组成的数组。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回乘积为正数的最长子数组长度。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [1,-2,-3,4]
|
|||
|
|
<strong>输出：</strong>4
|
|||
|
|
<strong>解释：</strong>数组本身乘积就是正数，值为 24 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [0,1,-2,-3,-4]
|
|||
|
|
<strong>输出：</strong>3
|
|||
|
|
<strong>解释：</strong>最长乘积为正数的子数组为 [1,-2,-3] ，乘积为 6 。
|
|||
|
|
注意，我们不能把 0 也包括到子数组中，因为这样乘积为 0 ，不是正数。</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [-1,-2,-3,0,1]
|
|||
|
|
<strong>输出：</strong>2
|
|||
|
|
<strong>解释：</strong>乘积为正数的最长子数组是 [-1,-2] 或者 [-2,-3] 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= nums.length <= 10^5</code></li>
|
|||
|
|
<li><code>-10^9 <= nums[i] <= 10^9</code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|