Sitrone
diff --git a/‎solutions/141. Linked List Cycle/AC_Floyd I.java‎
Lines changed: 0 additions & 32 deletions b/‎solutions/141. Linked List Cycle/AC_Floyd I.java‎
Lines changed: 0 additions & 32 deletions
@@ -1,32 +0,0 @@
-	/**
-	 * 1、Floyd判圈法（之前一直叫双指针跑圈法来着）
-	 * 
-	 *
-	 */
-/**
- * Definition for singly-linked list.
- * class ListNode {
- *     int val;
- *     ListNode next;
- *     ListNode(int x) {
- *         val = x;
- *         next = null;
- *     }
- * }
- */
-public class Solution {
-    public boolean hasCycle(ListNode head) {
-        if(head == null || head.next == null)
-			return false;
-		
-		ListNode slow = head;
-		ListNode fast = head;
-		do{
-			if(fast == null || fast.next == null) return false;
-			
-			slow = slow.next;
-			fast = fast.next.next;
-		}while(slow != fast);
-		return true;
-    }
-}