标签:cli tco next col def pre display == for
链接:https://leetcode-cn.com/problems/sort-list/
代码:
/** * 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) return nullptr; ListNode* cur = head; vector<int> v; while(cur) { v.push_back(cur->val); cur = cur->next; } sort(v.begin(), v.end()); cur = head; for(int i = 0; i < v.size(); i++) { cur->val = v[i]; cur = cur->next; } return head; } };
思路:把链表 copy 到数组中排序然后再重新返回到链表。也可递归,现在写
标签:cli tco next col def pre display == for
原文地址:https://www.cnblogs.com/FriskyPuppy/p/12953556.html