python 判断两整数区间的交并比

def winiou(laba,labb,laca,lacb):
    axls=[laba,labb,laca,lacb]
    
    
    axlsl=max([laba,laca])
    axlsr=min([labb,lacb])
    
    '''右端min-左端max if >0:重叠;else: 0， 下文中的epsilon是为了防止分母为0,python报错'''
    
    axls.sort()
    I=axlsr-axlsl
    
    print(axls)
    if I <0:
        I=0
        U=labb-laba + lacb-laca
    else:
        U=axls[-1]-axls[0]
          
    epsilon = 1e-7
    return (I)/(U+epsilon)    

print(winiou(0,0,7,7))