Leetcode-141环形链表

class Solution(object):
    def hasCycle(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """

        cur = head
        res = set()

        while cur:
            node = cur
           
            if node not in res:
                cur = cur.next
                res.add(node)
            else:
                return True
        return False
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19