Java——将单向链表按某值划分成左边小、中间相等、右边大的形式（进阶问题）

public static Node listPartition2(Node head,int pivot) {
Node sH = null;
Node sT = null;
Node eH = null;
Node eT = null;
Node bH = null;
Node bT = null;
Node next =null;
while(head!=null) {
next = head.next;
head.next = null;
if(head.value < pivot) {
if(sH==null) {
sH = head;
sT = head;
}else {
sT.next = head;
sT = head;
}
}else if(head.value == pivot) {
if(eH==null) {
eH = head;
eT = head;
}else {
eT.next = head;
eT = head;
}
}else {
if(bH==null) {
bH = head;
bT = head;
}else {
bT.next = head;
bT = head;
}
}
head = next;
}
if(sT != null) {
sT.next = eH;
eT = eT == null ? sT : eT;
}
if(eT!=null) {
eT.next = bH;
}
return sH != null ? sH : eH !=null ? eH : bH;
}