链表排序(归并排序法)

ListNode *sortList(ListNode *head) { //链表归并排序 if(head == nullptr || head->next == nullptr) return head; else{ //快慢指针找到中间节点 ListNode *fast = head,*slow = head;

>>阅读原文<<