150强访谈

最大乘积子数组

“最大乘积子数组”问题的详细指南和 Python 实现。

问题陈述

给定一个整数数组 nums,在数组中找到具有最大乘积的连续非空子数组,并返回该乘积。

生成测试用例后,答案将适合 32 位整数。

编写一个函数 maxProduct(nums: List[int]) -> int

约束条件
  • 1 <= len(nums) <= 2 * 10^4
  • -10 <= nums[i] <= 10
  • The product of any prefix or suffix of nums fits in a 32-bit integer

示例

Example 1
Input
nums = [2,3,-2,4]
Output
6
Explanation

[2,3] has the largest product 6.

Example 2
Input
nums = [-2,0,-1]
Output
0
Explanation

The result cannot be larger than 0 because of the negative numbers separated by 0.

Need a Hint?
考虑使用一维 DP 特定的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。