判断链表中是否存在环

class LNode:
    def __init__(self, val):
        self.val = val
        self.next = None

def exitLoop(LList):
    p1 = p2 = LList
    while p2 and p2.next:  #当链表为空或者只有一个结点时，返回False,不存在环
        p1 = p1.next
        p2 = p2.next.next
        if p1 == p2:
            return True
    return False

LList = LNode(1)
p1 = LNode(2)
p2 = LNode(3)
p3 = LNode(4)
p4 = LNode(5)
p5 = LNode(6)
LList.next = p1
p1.next = p2
p2.next = p3
p3.next = p4
p4.next = p5
#环
p5.next = p3
print(exitLoop(LList))