编程题--链表分割

 题目描述：

 编写代码，以给定值x为基准将链表分割成两部分，所有小于x的结点排在大于或等于x的结点之前

 给定一个链表的头指针 ListNode* pHead，请返回重新排列后的链表的头指针。

 注意：分割后保持原来的数据顺序不变

解题思路：

import java.util.*;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Partition {
    public ListNode partition(ListNode pHead, int x) {
        // write code here
        ListNode beforeStart = null;
        ListNode afterStart = null;
        ListNode beforeEnd = null;
        ListNode afterEnd = null;
        while (pHead != null){
            ListNode pHeadNext = pHead.next;
            pHead.next = null;
            if (pHead.val < x){
                if (beforeStart == null){
                    beforeStart = pHead;
                    beforeEnd = beforeStart;
                }else {
                    beforeEnd.next = pHead;
                    beforeEnd = beforeEnd.next;
                }
            }else {
                if (afterStart == null){
                    afterStart = pHead;
                    afterEnd = afterStart;
                }else {
                    afterEnd.next = pHead;
                    afterEnd = afterEnd.next;
                }
            }
            pHead = pHeadNext;
        }
        if (beforeStart == null){
            return afterStart;
        }
        beforeEnd.next = afterStart;//单链表拼接
        return beforeStart;
    }
}