Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.
合并相同的区域。
首先需要按internal[0]进行排序,直接sort就行。
然后遍历数组,用while循环(用for循环的时候删除列表中元素容易出现各种错误)。
然后就是比较前面一个元素的结尾和后面元素的开头。
如果进行合并的话需要删除,需要注意的是删除的时候i不需要+1。
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
intervals.sort()
i=1
while i<len(intervals):
if intervals[i-1][1]>=intervals[i][0]:
intervals[i-1][1]=max(intervals[i-1][1],intervals[i][1])
del intervals[i]
else:
i+=1
return intervals