Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 56 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 56 # by problem number
lcpy gen -s merge_intervals # by problem name
intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Input: intervals = [[1,4],[4,5]]
Output: [[1,5]]
Input: intervals = [[4,7],[1,4]]
Output: [[1,7]]
1 <= intervals.length <= 10^4intervals[i].length == 20 <= starti <= endi <= 10^4class Solution:
# Time: O(n log n)
# Space: O(1)
def merge(self, intervals: list[list[int]]) -> list[list[int]]:
intervals.sort()
merged = [intervals[0]]
for start, end in intervals[1:]:
if start <= merged[-1][1]:
merged[-1][1] = max(merged[-1][1], end)
else:
merged.append([start, end])
return merged
| Time | Space |
|---|---|
| O(n log n) | O(1) |