链表分割

题目描述

编写代码，以给定值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 beforeBg = null, beforeEd = null,
                afterBg = null,afterEd = null;
        while(pHead != null)
        {
            ListNode next = pHead.next;
            pHead.next = null;
            if(pHead.val <x)
            {
                if(beforeBg == null)
                {
                    beforeBg = pHead;
                    beforeEd = pHead;
                }
                else
                {
                    beforeEd.next = pHead;
                    beforeEd = pHead;
                }
            }
            else
            {
                if(afterBg == null)
                {
                    afterBg = pHead;
                    afterEd = pHead;
                }
                else
                {
                    afterEd.next = pHead;
                    afterEd = pHead;
                }
            }
            pHead = next;
        }
        
        if(beforeBg == null) return afterBg;
        beforeEd.next = afterBg;
        return beforeBg;
    }
}