# Definition for an interval.
# class Interval:
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e
class Solution:
def merge(self, intervals):
"""
:type intervals: List[Interval]
:rtype: List[Interval]
"""
intervals.sort(key=lambda x: x.start)
res=[]
for i in intervals:
if not res or i.start>res[-1].end:
res.append(i)
else:
res[-1].end=max(i.end,res[-1].end)
return res
Leetcode 56. Merge Intervals
最新推荐文章于 2023-12-08 13:02:57 发布