链表的归并排序
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *sortList(ListNode *head) {
if(head==nullptr||head->next==nullptr) return head;
ListNode *mid=middle(head);
ListNode *right=sortList(mid->next);
mid->next=nullptr;
ListNode *left=sortList(head);
return merge(left,right);
}
private:
ListNode* middle(ListNode *pHead)
{
ListNode *p=pHead;
ListNode *q=pHead->next;
while(q!=nullptr&&q->next!=nullptr)
{
p=p->next;
q=q->next->next;
}
return p;
}
ListNode* merge(ListNode *left,ListNode *right)
{
if(left==nullptr) return right;
if(right==nullptr) return left;
ListNode *temp=new ListNode(0);
ListNode *ptr=temp;
while(left!=nullptr&&right!=nullptr)
{
if(left->val<right->val)
{
ptr->next=left;
left=left->next;
}else{
ptr->next=right;
right=right->next;
}
ptr=ptr->next;
}
if(right!=nullptr) ptr->next=right;
if(left!=nullptr) ptr->next=left;
return temp->next;
}
};