牛客网--关于链表分隔

题目描述

编写代码，以给定值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
        if(pHead == null || pHead.next == null)
            return pHead;
        
        ListNode curr = new ListNode(-1);
        curr = pHead;
        
        ListNode small = new ListNode(-1);
        ListNode big = new ListNode(-1);
        ListNode s = small;
        ListNode b = big;
        
        while(curr != null)
        {
            if(curr.val < x)
            {
                s.next = new ListNode(curr.val);
                s = s.next;
            }
            else
            {
                b.next = new ListNode(curr.val);
                b = b.next;
            }
            curr = curr.next;
        }
        
        curr = s;
        while(curr.next != null)
            curr = curr.next;
        curr.next = big.next;
        return small.next;
    }
}