142. 环形链表 II--PYTHON

自己1：采用哈希表方法，不过这种方式需要查表，相应的时间花费会比较长。

# 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
        """

        id_list = list()
        p = head

        res = None
        while p:
            if str(id(p)) not in id_list:
                id_list.append(str(id(p)))
                p = p.next
            else:
                res = p
                break
        return p

大佬1：通过双指针方式，首先找到两个快慢指针的相遇点，然后通过表头和相遇点依次向后移动，找到入环点并进行返回。

# 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):

        if head is None: #排除了链表内没有元素的情况
            return None

        intersect = self.getIntersect(head) #返回相遇点
        if intersect is None: #如果没有相遇点那么么有环
            return None

        ptr1 = head    #从链表头部和相遇点，设置指针，同时向后移动，再次相遇点便是入环位置
        ptr2 = intersect
        while ptr1 != ptr2:
            ptr1 = ptr1.next
            ptr2 = ptr2.next

        return ptr1

    def getIntersect(self, head): #找到相遇点

        tortoise = head
        hare = head

        while hare is not None and hare.next is not None:
            tortoise = tortoise.next
            hare = hare.next.next
            if tortoise == hare:
                return tortoise

        return None