DSA 部分簡單

計數排序

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

問題陳述

簡單

寫一個函數 counting_sort(arr),使用計數排序演算法對非負整數 arr 清單進行排序。您可以假設元素是小範圍 [0, k] 內的整數。該函數應該傳回排序後的列表。

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

範例

Example 1
Input
arr = [4, 2, 2, 8, 3, 3, 1]
Output
[1, 2, 2, 3, 3, 4, 8]
Explanation

Frequencies of each element are counted, and cumulative counts are used to place elements in the sorted output array.

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

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