refactor 142

fishercoder1534 · fishercoder1534 · commit b1783506a60f · 2018-05-02T07:31:30.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_142.java b/src/main/java/com/fishercoder/solutions/_142.java
@@ -2,29 +2,35 @@
 
 import com.fishercoder.common.classes.ListNode;
 
-/**Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
+/**
+ * 142. Linked List Cycle II
+
+ Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
 
  Note: Do not modify the linked list.
 
  Follow up:
- Can you solve it without using extra space?*/
+ Can you solve it without using extra space?
+ */
 public class _142 {
 
+  public static class Solution1 {
     public ListNode detectCycle(ListNode head) {
-        ListNode slow = head;
-        ListNode fast = head;
-        while (fast != null && fast.next != null) {
+      ListNode slow = head;
+      ListNode fast = head;
+      while (fast != null && fast.next != null) {
+        slow = slow.next;
+        fast = fast.next.next;
+        if (slow == fast) {
+          ListNode slow2 = head;
+          while (slow2 != slow) {
             slow = slow.next;
-            fast = fast.next.next;
-            if ( slow == fast) {
-                ListNode slow2 = head;
-                while (slow2 != slow) {
-                    slow = slow.next;
-                    slow2 = slow2.next;
-                }
-                return slow;
-            }
+            slow2 = slow2.next;
+          }
+          return slow;
         }
-        return null;
+      }
+      return null;
     }
+  }
 }
