题目如下

数据范围

通过代码

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode() : val(0), next(nullptr) {}*     ListNode(int x) : val(x), next(nullptr) {}*     ListNode(int x, ListNode *next) : val(x), next(next) {}* };*/
class Solution {
public:ListNode* sortList(ListNode* head) {int n = 0;ListNode *t = head;vector<int> a;while(t != nullptr){n++;a.push_back(t->val);t = t -> next;}sort(a.begin(),a.end());t = head;for(int i = 0;i < a.size();i++){t -> val = a[i];t = t -> next;}return head;}
};