refactor 143

fishercoder1534 · fishercoder1534 · commit ecaa664a73dd · 2018-05-03T08:18:23.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_143.java b/src/main/java/com/fishercoder/solutions/_143.java
@@ -15,51 +15,52 @@
  */
 public class _143 {
 
-    public void reorderList(ListNode head) {
-        if (head == null || head.next == null) {
-            return;
-        }
-		/* first we use two pointers to separate this list into two parts */
-        ListNode slowNode = head;
-        ListNode fastNode = head;
-        while (fastNode.next != null) {
-            fastNode = fastNode.next;
-            if (fastNode.next != null) {
+    public static class Solution1 {
+        public void reorderList(ListNode head) {
+            if (head == null || head.next == null) {
+                return;
+            }
+            /* first we use two pointers to separate this list into two parts */
+            ListNode slowNode = head;
+            ListNode fastNode = head;
+            while (fastNode.next != null) {
                 fastNode = fastNode.next;
-            } else {
-                break;
+                if (fastNode.next != null) {
+                    fastNode = fastNode.next;
+                } else {
+                    break;
+                }
+                slowNode = slowNode.next;
             }
-            slowNode = slowNode.next;
-        }
-        // two sublist heads
-        ListNode head1 = head;
-        ListNode head2 = slowNode.next;
-        // detach the two sublists;
-        slowNode.next = null;
+            // two sublist heads
+            ListNode head1 = head;
+            ListNode head2 = slowNode.next;
+            // detach the two sublists;
+            slowNode.next = null;
 
-        // reverse the second sublist
-        ListNode cur = head2;
-        ListNode post = cur.next;
-        cur.next = null;
-        while (post != null) {
-            ListNode temp = post.next;
-            post.next = cur;
-            cur = post;
-            post = temp;
-        }
-        head2 = cur;// the new head of the reversed sublist
+            // reverse the second sublist
+            ListNode cur = head2;
+            ListNode post = cur.next;
+            cur.next = null;
+            while (post != null) {
+                ListNode temp = post.next;
+                post.next = cur;
+                cur = post;
+                post = temp;
+            }
+            head2 = cur;// the new head of the reversed sublist
 
-        // merge the two sublists as required
-        ListNode p = head1;
-        ListNode q = head2;
-        while (q != null) {
-            ListNode temp1 = p.next;
-            ListNode temp2 = q.next;
-            p.next = q;
-            q.next = temp1;
-            p = temp1;
-            q = temp2;
+            // merge the two sublists as required
+            ListNode p = head1;
+            ListNode q = head2;
+            while (q != null) {
+                ListNode temp1 = p.next;
+                ListNode temp2 = q.next;
+                p.next = q;
+                q.next = temp1;
+                p = temp1;
+                q = temp2;
+            }
         }
     }
-
 }
