@@ -0,0 +1,655 @@
+/**%0A * Definition for singly-linked list.%0A * class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int x) %7B%0A *         val = x;%0A *         next = null;%0A *     %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public boolean hasCycle(ListNode head) %7B%0A        if (head == null) %7B%0A            return false;%0A        %7D%0A        ListNode fast = head.next;%0A        ListNode slow = head;%0A        %0A        while(fast != null && fast.next != null) %7B%0A            if (fast == slow %7C%7C fast.next == slow) %7B%0A                return true;%0A            %7D%0A            fast = fast.next.next;%0A            slow = slow.next;%0A        %7D%0A        %0A        return false;%0A    %7D%0A%7D%0A

Create Linked_List_Cycle.java