141. Linked List Cycle

# 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,fast=slow.next,fast.next.next
            return True
        except:
            return False