链表的归并排序算法

public static ListNode mergeTwoList(ListNode headA,ListNode headB){
ListNode rehead=new ListNode(0);
ListNode pre=rehead;
while(headA!=null && headB!=null){
if(headA.val<=headB.val){
pre.next=headA;
headA=headA.next;
}
else{
pre.next=headB;
headB=headB.next;
}
pre=pre.next;
}

rehead.next=headA==null?headB:headA;
return rehead.next;
}