zoukankan      html  css  js  c++  java
  • leetcode986

    class Solution:
        def judgeIntersection(self,a:'Interval',b:'Interval'):
    
            #返回值1,bool类型,是否有交集:True-有交集,False-无交集
            #返回值2,int类型,哪个先结束:0-A先结束,1-B先结束,2-AB同时结束
            #返回值3,Interval类型,交集的值:有交集时是Interval实例,无交集时是None
    
            intersect = False
    
            firstEnd = 2
            if a.end < b.end:
                firstEnd = 0
            elif a.end > b.end:
                firstEnd = 1
            else:
                firstEnd = 2
    
            intersectArea = Interval()
    
            if a.start <= b.start and a.end >= b.start and a.end <= b.end:
                #print('True,[b.start,a.end]')
                intersect = True
                intersectArea.start=b.start
                intersectArea.end=a.end
            elif a.start >= b.start and a.start <= b.end and a.end >= b.end:
                #print('True,[a.start,b.end]')
                intersect = True
                intersectArea.start=a.start
                intersectArea.end=b.end
            elif a.start>= b.start and a.end <= b.end:
                #print('True,[a.start,a.end]')
                intersect = True
                intersectArea.start=a.start
                intersectArea.end=a.end
            elif a.start<=b.start and a.end >= b.end:
                #print('True,[b.start,b.end]')
                intersect = True
                intersectArea.start=b.start
                intersectArea.end=b.end
            elif a.end < b.start:
                #print('False,None')
                intersect = False
                intersectArea = None
            elif a.start > b.end:
                #print('False,None')
                intersect = False
                intersectArea = None
            else:
                print('error')
    
            return intersect,firstEnd,intersectArea
    
        def intervalIntersection(self, A: 'List[Interval]', B: 'List[Interval]') -> 'List[Interval]':
            Aindex = 0
            Bindex = 0
            Alen = len(A)
            Blen = len(B)
            ListI = list()
    
            while Aindex < Alen and Bindex < Blen:
                r1,r2,r3 = self.judgeIntersection(A[Aindex],B[Bindex])
                if r1:
                    ListI.append(r3)
                
                if r2 == 0:
                    Aindex+=1
                elif r2 == 1:
                    Bindex+=1
                else:
                    Aindex+=1
                    Bindex+=1
    
            return ListI
  • 相关阅读:
    HDU 4782 Beautiful Soup (模拟+注意细节)
    Linux 简单socket实现UDP通信
    Linux 简单socket实现TCP通信
    HDU 1698 Just a Hook(线段树区间覆盖)
    HDU 1271 整数对(思路题)
    HDU 2222 Keywords Search (AC自动机模板题)
    Windows平台使用Gitblit搭建Git服务器图文教程
    Git克隆
    移动端布局,div按比例布局,宽度为百分比,高度和宽度一样,即让div为正方形
    calc()问题
  • 原文地址:https://www.cnblogs.com/asenyang/p/10352958.html
Copyright © 2011-2022 走看看