接外包,有相关需求的可以联系我:Telegram | Email

Merge Intervals

该文章创建(更新)于04/11/2022,请注意文章的时效性!

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Solution

  • submit code
class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:

        if len(intervals) == 1:
            return [intervals[0]]

        ret = []

        # 按第一个元素排序
        intervals.sort(key=self.merge_sort)

        # 相同起点,按终点降序
        for X in range(1,len(intervals)):
            if intervals[X][0] == intervals[X-1][0] and intervals[X][1] < intervals[X-1][1]:
                intervals[X-1][1],intervals[X][1] = intervals[X][1],intervals[X-1][1]


        left = intervals[0][0]
        right = intervals[0][1]
        for i in range(1,len(intervals)):
            # 相交区间合并
            if intervals[i][0] <= right and intervals[i][1] >= right:
                right = intervals[i][1]
            # 单独的/不相交区间,不合并
            elif intervals[i][0] > right:
                ret.append([left,right])
                left = intervals[i][0]
                right = intervals[i][1]
            # 末尾数取值
            if i == len(intervals)-1:
                ret.append([left,right])

        return ret

    def merge_sort(self, elem):
        return elem[0]
  • full code
class Solution:
    def merge(self, intervals):

        if len(intervals) == 1:
            return [intervals[0]]

        ret = []

        # 按第一个元素排序
        intervals.sort(key=self.merge_sort)

        # 相同起点,按终点降序
        for X in range(1,len(intervals)):
            if intervals[X][0] == intervals[X-1][0] and intervals[X][1] < intervals[X-1][1]:
                intervals[X-1][1],intervals[X][1] = intervals[X][1],intervals[X-1][1]

        print(intervals)

        left = intervals[0][0]
        right = intervals[0][1]
        print(len(intervals))
        for i in range(1,len(intervals)):
            print("i:",i,"left:",left,"right:",right,"intervals[i][0]",intervals[i][0],"intervals[i][1]",intervals[i][1])
            # 相交区间合并
            if intervals[i][0] <= right and intervals[i][1] >= right:
                right = intervals[i][1]
            # 单独的/不相交区间,不合并
            elif intervals[i][0] > right:
                ret.append([left,right])
                left = intervals[i][0]
                right = intervals[i][1]
            # 末尾数取值
            if i == len(intervals)-1:
                ret.append([left,right])
            print((left,right))

        return ret

    def merge_sort(self, elem):
        return elem[0]


S = Solution()
# print(S.merge([[1,3],[2,6],[2,3],[8,10],[15,18],[17,20]]))
# print(S.merge([[1,4],[4,5]]))
# print(S.merge([[1,3],[2,6],[8,10],[15,18]]))
# print(S.merge([[1,4],[0,4]]))
# print(S.merge([[1,4]]))
print(S.merge([[1,4],[2,3]]))


👇 Share | 分享 👇


要不赞赏一下?

微信
支付宝
PayPal
Bitcoin

版权声明 | Copyright

除非特别说明,本博客所有作品均采用知识共享署名-非商业性使用-禁止演绎 4.0 国际许可协议进行许可。转载请注明转自-
https://www.emperinter.info/2022/04/11/merge-intervals/


要不聊聊?

我相信你准备留下的内容是经过思考的!【勾选防爬虫,未勾选无法留言】

*

*



微信公众号

👉 NewsLetter ❤️ 邮箱订阅 👈

优惠码