LeetCode interval section

Posted 2023-02-07 zbxzc

 

class Solution(object):
    def intervalIntersection(self, A, B):
        """
        :type A: List[Interval]
        :type B: List[Interval]
        :rtype: List[Interval]
        """
        re = []
        while len(A)>0 and len(B)>0:
            if B[0][0]<A[0][0]:
                C=A
                A=B
                B=C
            if B[0][0]>A[0][1]:
                A=A[1:]
                continue
            if B[0][1]<=A[0][1]:
                re.append([B[0][0],B[0][1]])
                B=B[1:]
                continue
            re.append([B[0][0],A[0][1]])
            A=A[1:]
        return re


sl=Solution()
#A = [[0,2],[5,10],[13,23],[24,25]]
#B = [[1,5],[8,12],[15,24],[25,26]]
print sl.intervalIntersection(A,B)