@@ -0,0 +1,439 @@
+# Definition for singly-linked list.%0A# class ListNode:%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.next = None%0A%0A%0Aclass Solution:%0A    # @param head, a ListNode%0A    # @return a boolean%0A%0A    def hasCycle(self, head):%0A        fast = slow = head%0A        while fast and fast.next:%0A            slow = slow.next%0A            fast = fast.next.next%0A            if slow == fast:%0A                return True%0A        return False%0A

add solution for Linked List Cycle