链表分割（java）

 

编写代码，以给定值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 pLeft=new ListNode(-1);
        ListNode pRight=new ListNode(-1);
        ListNode left=pLeft;
        ListNode right=pRight;
        ListNode cur=pHead;
        while (cur != null) {
            if (cur.val < x) {
                    left.next = cur;
                    left = cur;
            } else {
                    right.next = cur;
                    right = cur;
            }
            cur = cur.next;
        }
        if (pLeft.next == null) return pRight.next;
        left.next = pRight.next;
        if (pRight.next != null) right.next = null;
        return pLeft.next;
    }
}

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 pLeft=null;
        ListNode pRight=null;
        ListNode left=null;
        ListNode right=null;
        ListNode cur = pHead;
        while (cur != null) {
            if (cur.val < x) {
                if (pLeft == null) {
                    left = pLeft = cur;
                } else {
                    left.next = cur;
                    left = cur;
                }
            } else {
                if (pRight == null) {
                    right = pRight = cur;
                } else {
                    right.next = cur;
                    right = cur;
                }
            }
            cur = cur.next;
        }
        if (pLeft == null) return pRight;
        left.next = pRight;
        if (right != null) right.next = null;
        return pLeft;
    }
}