150强访谈简单

合并间隔

“合并间隔”问题的详细指南和 Python 实现。

问题陈述

简单

给定一个区间数组,其中区间[i] = [starti, endi],合并所有重叠区间,并返回覆盖输入中所有区间的非重叠区间数组。

编写一个函数 merge(intervals: List[List[int]]) -> List[List[int]]

约束条件
  • 1 <= len(intervals) <= 10^4
  • intervals[i].length == 2
  • 0 <= starti <= endi <= 10^4

示例

Example 1
Input
intervals = [[1,3],[2,6],[8,10],[15,18]]
Output
[[1,6],[8,10],[15,18]]
Explanation

Intervals [1,3] and [2,6] overlap, merge to [1,6].

Example 2
Input
intervals = [[1,4],[4,5]]
Output
[[1,5]]
Explanation

[1,4] and [4,5] overlap.

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

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