leetcode 腾讯精选练习（50 题）141.环形链表

最新推荐文章于 2019-06-28 20:32:43 发布

solejay

最新推荐文章于 2019-06-28 20:32:43 发布

阅读量123

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/m0_37991005/article/details/91410960

版权

leetcode 专栏收录该内容

50 篇文章 1 订阅

订阅专栏

原题目

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 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?

思路

第一遍解法

网上好的解法

def hasCycle(self, head):
    try:
        slow = head
        fast = head.next
        while slow is not fast:
            slow = slow.next
            fast = fast.next.next
        return True
    except:
        return False