leetcode Linked List Cycle II python

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def detectCycle(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return None
        if not head.next:
            return None
        turtle=head.next
        rabbit=head.next.next
        while turtle and rabbit:
            if turtle == rabbit:
                p=head
                while p != turtle:
                    p,turtle=p.next,turtle.next
                return p
            turtle=turtle.next
            if not rabbit.next:
                break
            rabbit=rabbit.next.next
        return None

@https://github.com/Linzertorte/LeetCode-in-Python/blob/master/LinkedListCycleII.py