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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。