@@ -0,0 +1,785 @@
+/**%0A * Problem Link: https://leetcode.com/problems/linked-list-cycle/%0A * %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        ListNode node1 = head;%0A        ListNode node2 = null;%0A        if(head != null && head.next != null) %7B%0A            node2 = head.next;%0A        %7D else %7B%0A            return false;%0A        %7D%0A        while(node1 != null) %7B%0A            if(node1 == node2) return true;%0A            node1 = node1.next;%0A            if(node2.next != null && node2.next.next != null) node2 = node2.next.next;%0A            else return false;%0A        %7D%0A        return false;%0A    %7D%0A%7D%0A

Create Linked_List_Cycle.java