refactor 86

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_86.java

@@ -2,17 +2,7 @@
 
 import com.fishercoder.common.classes.ListNode;
 
-/**
- * 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.
- */
 public class _86 {
-
     public static class Solution1 {
         public ListNode partition(ListNode head, int x) {
             if (head == null || head.next == null) {