Leetcode 148. 排序链表

quicksort快排
也可用merge_sort

/**
 * 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) return head;
        ListNode*p=NULL,*pe=p,*q=NULL,*qe=q,*t=head;
        head=head->next;
        while(head){
            if(head->val<t->val){
                if(!p) p=pe=head;
                else pe->next=head,pe=head;
            }else{
                if(!q) q=qe=head;
                else qe->next=head,qe=head;
            }
            head=head->next;
        }
        if(pe) pe->next=NULL;
        if(qe) qe->next=NULL;
        p=sortList(p);
        q=sortList(q);
        if(p){
            pe=p;
            while(pe->next) pe=pe->next;
            pe->next=t,t->next=q;
        }else
            p=t,t->next=q;
        return p;
    }
};