56. Merge Intervals【H】【67】

最新推荐文章于 2025-12-04 23:36:16 发布

原创最新推荐文章于 2025-12-04 23:36:16 发布 · 353 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #leetcode题解 #排序

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种有效的算法来合并一系列可能存在重叠的区间。通过示例说明了如何将输入的区间列表 [1,3],[2,6],[8,10],[15,18] 合并为 [1,6],[8,10],[15,18]。该算法首先将所有区间端点排序，然后遍历这些端点来合并重叠的区间。

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

Subscribe to see which companies asked this question

# 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):
        l = []
        for i in intervals:
            l += [i.start,i.end],
            
        l.sort()
        res = []
        
        i = 0
        while i < (len(l)):
        	s = l[i][0]
        	e = l[i][1]
        
        	while i < len(l)-1 and l[i+1][0] <= e:
        		e = max(l[i+1][1],e)
        		i += 1
        	res += Interval(s,e),
        	i += 1
        
        return res
                
                
                
                        
        """
        :type intervals: List[Interval]
        :rtype: List[Interval]
        """