Python 基礎知識簡單

找出數組中元素的頻率

「尋找數組中元素的頻率」問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 frequency(arr) ,它接受整數列表 arr 並傳回一個字典,其中每個鍵是數組中的一個元素,每個值是該元素出現的次數。傳回按鍵升序排序的字典。

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

範例

Example 1
Input
arr = [1, 2, 2, 3, 3, 3]
Output
{1: 1, 2: 2, 3: 3}
Explanation

1 appears once, 2 appears twice, 3 appears three times.

Example 2
Input
arr = [5, 5, 5, 5]
Output
{5: 4}
Explanation

5 appears four times.

Example 3
Input
arr = [4, 1, 2, 1, 4]
Output
{1: 2, 2: 1, 4: 2}
Explanation

1 appears 2 times, 2 appears 1 time, 4 appears 2 times.

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

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