refactor 86

fishercoder1534 · fishercoder1534 · commit 1a03f8b071f3 · 2018-02-27T07:22:15.000-08:00
diff --git a/README.md b/README.md
@@ -603,7 +603,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |89|[Gray Code](https://leetcode.com/problems/gray-code/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_89.java)|O(n) |O(1)||Medium|Bit Manipulation
 |88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_88.java)|O(max(m,n)) |O(1)||Easy|
 |87|[Scramble String](https://leetcode.com/problems/scramble-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_87.java)|O(?) |O(?)||Hard| Recursion
-|86|[Partition List](https://leetcode.com/problems/partition-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_86.java)|O(n) |O(1)||Medium|
+|86|[Partition List](https://leetcode.com/problems/partition-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_86.java)|O(n) |O(1)||Medium| Linked List
 |85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_85.java)|O(m*n) |O(n)||Hard|DP
 |84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_84.java)|O(n) |O(n)||Hard|Array, Stack
 |83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_83.java)|O(n) |O(1)||Easy| Linked List
diff --git a/src/main/java/com/fishercoder/solutions/_86.java b/src/main/java/com/fishercoder/solutions/_86.java
@@ -15,27 +15,28 @@
  */
 public class _86 {
 
+  public static class Solution1 {
     public ListNode partition(ListNode head, int x) {
-        if (head == null || head.next == null) {
-            return head;
+      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;
         }
-        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;
     }
-
+  }
 }
