题解 | #单链表的排序#

class Solution {
public:
    
    ListNode* sortInList(ListNode* head) {
        vector<int> v;//辅助数组
        ListNode *p=head;
        while(p!=nullptr){//遍历链表并将值存入数组
            v.push_back(p->val);
            p=p->next;
        }
        sort(v.begin(),v.end());//快排
        p=head;
        int i=0;
        while(p){//遍历链表并覆盖为排序后的值
            p->val=v[i++];
            p=p->next;
        }
        return head;
    }
};