@@ -0,0 +1,459 @@
+package leetcode.linked_list_cycle;%0A%0Aimport common.ListNode;%0A%0Apublic class Solution %7B%0A%09public boolean hasCycle(ListNode head) %7B%0A        ListNode hare = head, tortoise = head;%0A        while(hare != null)%7B%0A            hare = hare.next;%0A            if(hare == null) return false;%0A            hare = hare.next;%0A            tortoise = tortoise.next;%0A            if(hare == tortoise)%7B%0A                return true;%0A            %7D%0A        %7D%0A        return false;%0A%09%7D%0A%7D%0A

Add java solution for 141. Linked List Cycle