@@ -0,0 +1,710 @@
+package me.wayne.leetcodetop100.listnode;%0A%0Aimport me.wayne.leetcodetop100.ListNode;%0A%0A/**%0A * %E7%BB%99%E4%BD%A0%E4%B8%80%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%B4%E8%8A%82%E7%82%B9 head %EF%BC%8C%E5%88%A4%E6%96%AD%E9%93%BE%E8%A1%A8%E4%B8%AD%E6%98%AF%E5%90%A6%E6%9C%89%E7%8E%AF%E3%80%82%0A *%0A * https://leetcode-cn.com/problems/linked-list-cycle/%0A */%0Apublic class LC141_HasCycle %7B%0A%0A    public boolean hasCycle(ListNode head) %7B%0A        ListNode oneStep = head;%0A        ListNode twoStep = head;%0A        boolean res = false;%0A        while (twoStep != null) %7B%0A            twoStep = twoStep.next;%0A            if (twoStep == null) %7B%0A                break;%0A            %7D%0A            twoStep = twoStep.next;%0A%0A            oneStep = oneStep.next;%0A%0A            if (twoStep == oneStep) %7B%0A                res = true;%0A                break;%0A            %7D%0A        %7D%0A        return res;%0A    %7D%0A%7D%0A

add LC141_HasCycle