python找出连续的数组

def continuity(aa): #找出连续的数组
    pn={}
    l1=[]
    i=0
    for x in sorted(set(aa)):
        l1.append(x)
        if x+1 not in aa:#出现不连续的情况
            #if len(l1) != 1:
            pn.setdefault((i), [])
            # pn.setdefault((i, 'b1'), int)
            # pn.setdefault((i, 'b2'), int)
            pn[i]=l1
            # pn[i,'b1']=(min(pn[i]))
            pn[i].append(min(pn[i]))
            pn[i].append(max(pn[i]))
            # pn[i,'b2']=(max(pn[i]))
            i=i+1
            # print(l1)
            l1 = []
    return pn