LeetCode 986. Interval List Intersections 解题报告(python)

本文链接：https://blog.csdn.net/Orientliu96/article/details/103199154

986. Interval List Intersections

Interval List Intersections python solution

题目描述

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].)

在这里插入图片描述

解析

题目比较好理解，循环的终止条件是A，B集合都被遍历结束。
符合条件的数集会被保存下来，然后小的进行下一个元素的判断

class Solution:
    def intervalIntersection(self, A: List[List[int]], B: List[List[int]]) -> List[List[int]]:
        i=0
        j=0
        res=[]
        while i<len(A) and j<len(B):
            start=max(A[i][0],B[j][0])
            end=min(A[i][1],B[j][1])
            if start<=end:
                res.append([start,end])
            if A[i][1]<=B[j][1]:
                i+=1
            else:
                j+=1          
        return res