-
Notifications
You must be signed in to change notification settings - Fork 0
/
03-sortLinkList.cpp
45 lines (43 loc) · 1017 Bytes
/
03-sortLinkList.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// Á´±í¹é²¢ÅÅÐò
ListNode *mergeList(ListNode *l1, ListNode *l2)
{
ListNode *node1 = l1;
ListNode *node2 = l2;
ListNode dummy;
ListNode *node = &dummy;
while (node1 && node2)
{
if (node1->val <= node2->val)
{
node->next = node1;
node1 = node1->next;
}
else
{
node->next = node2;
node2 = node2->next;
}
node = node->next;
}
if (node1)
node->next = node1;
if (node2)
node->next = node2;
return dummy.next;
}
ListNode* sortLinkList(ListNode *head) {
if (!head || !head->next)
return head;
ListNode *slow = head;
ListNode *fast = head;
while (fast->next && fast->next->next)
{
slow = slow->next;
fast = fast->next->next;
}
ListNode *head2 = slow->next;
slow->next = NULL;
ListNode *pleft = sortLinkList(head);
ListNode *pright = sortLinkList(head2);
return mergeList(pleft, pright);
}