DSA 部分簡單

歸併排序

“合併排序”問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 merge_sort(arr),使用合併排序演算法依升序對整數列表 arr 進行排序,並傳回排序後的列表。

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

範例

Example 1
Input
arr = [38, 27, 43, 3, 9, 82, 10]
Output
[3, 9, 10, 27, 38, 43, 82]
Explanation

The list is divided in half recursively, sorted, and then merged back together.

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

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