LeetCode 1567. Maximum Length of Subarray With Positive Product - 亚马逊高频题10

CP Coding

于 2022-03-20 10:40:47 发布

阅读量513

点赞数 1

分类专栏：亚马逊高频题 Leetcode刷题笔记文章标签： leetcode 算法 python 数据结构动态规划

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/123607112

版权

这道题要求在给定的整数数组中找到乘积为正的最大子数组长度。通过动态规划策略，我们可以维护两个状态，分别表示从当前元素开始乘积为正和负的最长子数组长度。当遇到0时，两个状态都复位。对于正数，两个状态都增加1；对于负数，两个状态的更新取决于前一个元素对应状态的长度。最终，两个状态的最大值即为答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

最低0.47元/天解锁文章