-
Notifications
You must be signed in to change notification settings - Fork 0
/
insertionSortList.cc
71 lines (70 loc) · 2.11 KB
/
insertionSortList.cc
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *insertionSortList(ListNode *head) {
if (!head) return NULL;
if (!head->next) return head;
ListNode *dummy = new ListNode(INT_MIN);
dummy->next = head;
head = dummy;
ListNode *cur = head;
while (cur && cur->next) {
ListNode *first = head;
ListNode *second = head->next;
ListNode *tmp = cur->next;
while (second != cur->next && tmp->val >= second->val) {
first = second;
second = second->next;
}
if (!(!second || second == cur->next)) {
cur->next = tmp->next;
first->next = tmp;
tmp->next = second;
} else {
cur = cur->next;
}
}
head = head->next;
}
//----------------------------------------------//
ListNode *insertionSortList(ListNode *head) {
if (!head) return NULL;
ListNode *ret = head;
ListNode *cur = head->next;
ret->next = NULL;
while (cur) {
if (ret->val >= cur->val) {
ListNode *tmp = cur->next;
cur->next = ret;
ret = cur;
cur = tmp;
} else {
ListNode *cur1 = ret;
while (cur1->next) {
if (cur1->next->val > cur->val) {
ListNode *tmp = cur1->next;
ListNode *tmp1 = cur->next;
cur1->next = cur;
cur->next = tmp;
cur = tmp1;
break;
}
cur1 = cur1->next;
}
if (!cur1->next) {
cur1->next = cur;
cur = cur->next;
cur1->next->next = NULL;
}
}
}
return ret;
}
};