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

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