题目要求时间复杂度
O
(
n
log
n
)
O(n\log{n})
O(nlogn),空间复杂度
O
(
1
)
O(1)
O(1) 对链表排序,自然可以想到快速排序或者归并排序的方法,但是在链表中从后往前访问不太方便,所以选择了归并排序(merge sort)。
思想:递归地将链表从中间分成左右两部分,将两个链表合并成有序的链表并返回。
链表分开的方式,有两种:
- 记录链表的大小 n n n,移动指针进行分割( n 2 \frac{n}{2} 2n, n − n 2 n - \frac{n}{2} n−2n)
- 快慢指针。快指针移动速度为慢指针两倍时,找到中点。
附上代码:
class Solution {
public:
ListNode* mergesort(ListNode* head, int len){
if(len < 2) return head;
ListNode* cut = head;
for(int i = 1; i<len/2; i++) cut = cut->next;
ListNode* right = mergesort(cut->next, len - len/2);
cut->next = nullptr;
ListNode* left = mergesort(head, len/2);
//find head of new link
ListNode* newhead;
if(left->val <= right->val) {newhead = left; left = left->next;}
else {newhead = right; right = right->next;}
ListNode* curr = newhead;
// merge
while(left || right){
if(!left){curr->next = right; break;}
else if(!right){curr->next = left; break;}
else{
if(left->val <= right->val){
curr->next = left;
left = left->next;
} else {
curr->next = right;
right = right->next;
}
curr = curr->next;
}
}
return newhead;
}
ListNode* sortList(ListNode* head) {
int n = 0;
ListNode* temp = head;
while(temp) { temp = temp->next; n++;}
return mergesort(head, n);
}
};