leetcode day13 环形链表

1.题目描述

2.代码构思（debug）

class Solution:

def detectCycle(self, head: ListNode) -> ListNode:
    if not head:
        return 

    slow = head
    fast = head
   
    # while fast.next and fast.next.next:
    while True:
        if not (fast.next and fast.next.next):
            return 

        slow = slow.next
        fast = fast.next.next

        if slow == fast:
            break

    fast = head

    while fast != slow:
            fast = fast.next
            slow = slow.next
        
    return slow