Python 基础知识简单

按频率对数组元素进行排序

“按频率对数组元素进行排序”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 sort_by_frequency(arr),按频率降序对数组元素进行排序。如果两个元素具有相同的频率,则较小的元素在前。将排序后的数组作为列表返回。

约束条件
  • 1 <= len(arr) <= 10^5
  • -10^6 <= arr[i] <= 10^6

示例

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

2 appears 3 times (most frequent), 1 appears 2 times, 3 appears 1 time.

Example 2
Input
arr = [4, 4, 5, 5, 6]
Output
[4, 4, 5, 5, 6]
Explanation

4 and 5 both appear 2 times; 4 < 5 so 4 comes first. 6 appears once.

Example 3
Input
arr = [9, 9, 9]
Output
[9, 9, 9]
Explanation

Only one distinct element.

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

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。