java----partition将所有小于x的结点排在其余结点之前

1. 问题描述
   将所有小于 x 的结点排在其余节点之前, 要求原来数据的顺序不能改变, 返回排列后链表的头结点.
2. 解决思路
   ①设置两个链表(smallHead, bigHead) , smallHead 放小于 x 的结点, bigHead放大于或等于 x 的结点.
   ②遍历原本的链表将小于 x 的尾插到 smallHead, 大于或等于 x 的结点尾插到 bigHead (采用尾插是因为题目要求:原来数据的顺序不能改变).
3. 源代码

public class ListNode {
    int val;
    ListNode next;
    public ListNode(int val) {
        this.val = val;
    }
}

public class Partition {
    public static ListNode partition(ListNode pHead, int x) {
        ListNode smallHead = new ListNode(0);
        ListNode smallTail = smallHead;
        ListNode bigHead = new ListNode(0);
        ListNode bigTail = bigHead;
        ListNode cur = pHead;
        while (cur != null) {
            if (cur.val < x) {
                smallTail.next = new ListNode(cur.val);
                smallTail = smallTail.next;
            } else {
                bigTail.next = new ListNode(cur.val);
                bigTail = bigTail.next;
            }
            cur = cur.next;
        }
        smallTail.next = bigHead.next;
        return smallHead.next;
    }
}