DSA 部分簡單

最大和連續子數組

“最大和連續子數組”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 max_subarray_sum(arr),找出並傳回整數陣列 arr 中連續子陣列的最大和。

約束條件
  • 1 <= len(arr) <= 10^5
  • -10^4 <= arr[i] <= 10^4

範例

Example 1
Input
max_subarray_sum([-2, -3, 4, -1, -2, 1, 5, -3])
Output
7
Explanation

The contiguous subarray with the maximum sum is [4, -1, -2, 1, 5], summing to 7.

Example 2
Input
max_subarray_sum([-1])
Output
-1
Explanation

The maximum subarray contains only the element -1.

Need a Hint?
考慮使用特定於數組的資料結構,例如集合或堆。
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 資源

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