合并区间

完整代码

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        intervals.sort()
        result = []
        i = 0
        while i < len(intervals):
            t = intervals[i]
            i += 1
            entry = True
            while i < len(intervals) and entry:
                if t[1] >= intervals[i][0]:
                    if t[1] <= intervals[i][1]:
                        t[1] = intervals[i][1]
                        i += 1
                    else:
                        i += 1
                else:
                    entry = False
            
            result.append(t)
        return result