Sort List
Sort a linked list in O(n log n) time using constant space complexity.
本题不想做了,参考链接:(主要采用merge的思想进行做题)
http://www.cnblogs.com/ganganloveu/p/3763707.html
http://www.cnblogs.com/bakari/p/4009526.html
https://yq.aliyun.com/articles/3664
ListNode* sortList(ListNode* head) {
if(head == NULL || head->next == NULL)
return head;
ListNode* head1 = head;
ListNode* head2 = getMid(head);
head1 = sortList(head1);
head2 = sortList(head2);
return merge(head1, head2);
}
ListNode* merge(ListNode* head1, ListNode* head2) //复用Merge Two Sorted Lists的方法
{
ListNode* newhead = new ListNode(-1);
ListNode* newtail = newhead;
while(head1 != NULL && head2 != NULL)
{
if(head1->val <= head2->val)
{
newtail->next = head1;
head1 = head1->next;
}
else
{
newtail->next = head2;
head2 = head2->next;
}
newtail = newtail->next;
newtail->next = NULL;
}
if(head1 != NULL)
newtail->next = head1;
if(head2 != NULL)
newtail->next = head2;
return newhead->next;
}
ListNode* getMid(ListNode* head)
{
//guaranteed that at least two nodes
ListNode* fast = head->next;
ListNode* slow = head->next;
ListNode* prev = head;
while(true)
{
if(fast != NULL)
fast = fast->next;
else
break;
if(fast != NULL)
fast = fast->next;
else
break;
prev = slow;
slow = slow->next;
}
prev->next = NULL; // cut
return slow;
}