[LeetCode By Python]141. Linked List Cycle

题目：

---

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

Follow up:
Can you solve it without using extra space?

解释：判断链表是否有环，如果可以用额外空间，可以使用字典记录键的次数，大于1则存在环。现有情况下可以用快慢指针方法，慢指针走一步，快指针走两步，如果有环，则快慢指针会相遇。

代码：

# 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 or head.next == 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