芜湖~~
# class Interval:
# def __init__(self, a=0, b=0):
# self.start = a
# self.end = b
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param intervals Interval类一维数组
# @return Interval类一维数组
#
class Solution:
def merge(self, intervals: List[Interval]) -> List[Interval]:
if not intervals:
return []
# 按区间的起始点进行排序
intervals.sort(key=lambda x: x.start)
merged = [intervals[0]]
for interval in intervals[1:]:
last_interval = merged[-1]
if interval.start <= last_interval.end:
# 有重叠,合并区间
last_interval.end = max(last_interval.end, interval.end)
else:
# 无重叠,添加新区间
merged.append(interval)
return merged

京公网安备 11010502036488号