Leetcode 141:Linked List Cycle python

题目

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.

解法1

构建一个seen列表，元素为node，如果当前node在seen中，则说明成环，否则整个链表结束都没有出现重复node则证明不成环。list的元素几乎可以是各种数据类型，甚至是类实例也可以。所以直接将node作为seen的元素即可。

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