题解 | #合并区间#

from heapq import merge
import re
# 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]:
        # write code here
        def mergelist(ls):
            n = len(ls) - 1
            ls[n-1].end = max(ls[n-1].end, ls[n].end)
            ls.pop()
            return ls

        intervals.sort(key= lambda x: x.start)
        res = []
        if len(intervals) == 0:
            return res
        res.append(intervals[0])
        for i in range(1, len(intervals)):
            res.append(intervals[i])
            n = len(res) - 1
            if res[n].start <= res[n-1].end:
                res = mergelist(res)
        return res