判断给定的链表中是否有环。如果有环则返回true，否则返回false。 你能给出空间复杂度的解法么？

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

#
# 
# @param head ListNode类 
# @return bool布尔型


#快慢指针法：
class Solution:
    def hasCycle(self , head ):
        if not head:
            return False
        slow = head
        fast = head.next
        flag = False
        while fast and fast.next:
            if slow == fast:
                return True
            slow = slow.next
            fast = fast.next.next
        return False
        # write code here