[leetcode: 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?

不使用额外空间，可以吗？

方法一：性能136ms

# 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
        fast = head
        slow = head
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
            if fast == slow:
                return True
        return False

方法二：性能65ms

# 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
        """
        try:
            slow,fast=head,head.next
            while slow is not fast:
                slow=slow.next
                fast=fast.next.next
            return True
        except:
                return False