refactor 86

fishercoder1534 · fishercoder1534 · commit af6199936ab2 · 2020-03-13T06:25:39.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_86.java b/src/main/java/com/fishercoder/solutions/_86.java
@@ -6,37 +6,35 @@
  * 86. Partition List
  *
  * Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
-
- You should preserve the original relative order of the nodes in each of the two partitions.
-
- For example,
- Given 1->4->3->2->5->2 and x = 3,
- return 1->2->2->4->3->5.
+ * You should preserve the original relative order of the nodes in each of the two partitions.
+ * For example,
+ * Given 1->4->3->2->5->2 and x = 3,
+ * return 1->2->2->4->3->5.
  */
 public class _86 {
 
-  public static class Solution1 {
-    public ListNode partition(ListNode head, int x) {
-      if (head == null || head.next == null) {
-        return head;
-      }
-      ListNode left = new ListNode(0);
-      ListNode right = new ListNode(0);
-      ListNode less = left;
-      ListNode greater = right;
-      while (head != null) {
-        if (head.val < x) {
-          less.next = head;
-          less = less.next;
-        } else {
-          greater.next = head;
-          greater = greater.next;
+    public static class Solution1 {
+        public ListNode partition(ListNode head, int x) {
+            if (head == null || head.next == null) {
+                return head;
+            }
+            ListNode left = new ListNode(0);
+            ListNode right = new ListNode(0);
+            ListNode less = left;
+            ListNode greater = right;
+            while (head != null) {
+                if (head.val < x) {
+                    less.next = head;
+                    less = less.next;
+                } else {
+                    greater.next = head;
+                    greater = greater.next;
+                }
+                head = head.next;
+            }
+            greater.next = null;
+            less.next = right.next;
+            return left.next;
         }
-        head = head.next;
-      }
-      greater.next = null;
-      less.next = right.next;
-      return left.next;
     }
-  }
 }
