给出一个区间的集合,请合并所有重叠的区间。
示例 1:
输入: [[1,3],[2,6],[8,10],[15,18]]
输出: [[1,6],[8,10],[15,18]]
解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].
示例 2:
输入: [[1,4],[4,5]]
输出: [[1,5]]
解释: 区间 [1,4] 和 [4,5] 可被视为重叠区间。
思路:
(the interface of this problem has changed, for the new version, please look at the second solution below)
先把intervals按照interval.start从小到大的顺序排好序,
(intervals = sorted(intervals,key=lambda x:x.start) 这一行代码是从评论区学来的)
用left和right 作为当前的左端点和右端点,
每次扫描到一个新的元素时item,如果item.start比right小,则说明当前的item可以被合并,新的合并区间的右端点应该为item.end和right的最大值,
如果item.start比right大,则说明item不能被合并,需要将left和right添加到答案里,然后重置为item.start, item.end
# Definition for an interval.
# class Interval(object):
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e
class Solution(object):
def merge(self, intervals):
"""
:type intervals: List[Interval]
:rtype: List[Interval]
"""
if not intervals:
return []
intervals = sorted(intervals,key=lambda x:x.start)
res = []
left = intervals[0].start
right = intervals[0].end
for item in intervals:
if item.start <= right:
right = max(right, item.end)
else:
res.append([left, right])
left = item.start
right = item.end
res.append([left, right])
return res
class Solution(object):
def merge(self, intervals):
"""
:type intervals: List[List[int]]
:rtype: List[List[int]]
"""
if not intervals or not intervals[0]:
return intervals
intervals = sorted(intervals, key = lambda x:x[0])
res = []
start, end = intervals[0][0], intervals[0][1]
for i in range(len(intervals)):
s, e = intervals[i][0], intervals[i][1]
if s <= end: # overlap
end = max(end, e)
else:
res.append([start, end])
start, end = s, e
res.append([start, end])
return res