【leetcode】(python)141. Linked List Cycle关联名单周期

141. Linked List Cycle Easy

Description

Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example

• Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

• Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

• Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

• Follow up:

Can you solve it using O(1) (i.e. constant) memory?

题意

给定一个数组代表的单链表，判断其中是否有循环。

题解思路

数据结构中的简单单链表循环是从尾结点到头结点的循环，而这里可以是从尾结点到其前面任意结点的循环。解循环的思路其实应该有些的，这里采用快慢指针的方法，如果有循环的话，快指针肯定会追上慢指针的，可以想象两个人在操场跑步的情况，不管两个人的起始是否一样，跑得快的人肯定会遇到跑得慢的人。

code

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

class Solution(object):
    def hasCycle(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        if head == None:
            return False
        slow = fast = head
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
            if slow == fast:
                return True
        return False