56.md

题目地址

https://leetcode-cn.com/problems/merge-intervals/

解答

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        """ 合并区间 """
        if (len(intervals) <= 1):
            return intervals
        intervals.sort()
        rs = [intervals[0]]
        for i in range(1, len(intervals)):
            if (rs[-1][0] <= intervals[i][0] <= rs[-1][1]):
                rs[-1][1] = max(rs[-1][1], intervals[i][1])
            else:
                rs.append(intervals[i])
        return rs