Leetcode May Challenge - 05/23: Interval List Intersections(Python)

最新推荐文章于 2024-09-15 22:31:42 发布

RaymondXue

最新推荐文章于 2024-09-15 22:31:42 发布

阅读量102

点赞数

分类专栏： Leetcode 文章标签：列表 python 数据结构 leetcode

本文链接：https://blog.csdn.net/m0_37923155/article/details/106309642

版权

Leetcode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

题目描述

Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order.

Return the intersection of these two interval lists.

(Formally, a closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b. The intersection of two closed intervals is a set of real numbers that is either empty, or can be represented as a closed interval. For example, the intersection of [1, 3] and [2, 4] is [2, 3].)

例子

在这里插入图片描述

Input: A = [[0,2],[5,10],[13,23],[24,25]], B = [[1,5],[8,12],[15,24],[25,26]]
Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
Reminder: The inputs and the desired output are lists of Interval objects, and not arrays or lists.

解释

给两个区间序列，其中都是闭区间，找到他们的所有交集并输出。

思路双指针

首先我们看到列表A和B都是排过序的。
我们用两个指针分别指向列表A、B的头部区间，然后判断这两个指针指向的区间是否有交集，如果有，则放入结果列表res中。然后判断两个指针指向的区间，哪个区间的结束值较小，则把对应的指针向后移一位。一直循环该过程，直到有一个列表遍历完毕即可输出结果。

代码

class Solution(object):
    def intervalIntersection(self, A, B):
        """
        :type A: List[List[int]]
        :type B: List[List[int]]
        :rtype: List[List[int]]
        """
        res = []
        pA, pB = 0, 0
        while pA <len(A) and pB < len(B):
            l = max(A[pA][0], B[pB][0])
            r = min(A[pA][1], B[pB][1])
            if l <= r:
                res.append([l, r])
            if A[pA][1] <= B[pB][1]:
                pA += 1
            else:
                pB += 1
        return res