-
Notifications
You must be signed in to change notification settings - Fork 0
/
147.insertion-sort-list.cpp
46 lines (42 loc) · 1.05 KB
/
147.insertion-sort-list.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
/*
* @lc app=leetcode id=147 lang=cpp
*
* [147] Insertion Sort List
*/
// @lc code=start
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
ListNode dummy(0, head);
if (!head||!head->next) return head;
ListNode *pre = head, *cur = head->next;
ListNode *tmp;
while(cur) {
if (cur->val >= pre->val) {
pre = cur;
cur = cur->next;
continue;
}
tmp = &dummy;
while(tmp->next && cur->val > tmp->next->val) {
tmp = tmp->next;
}
pre->next = cur->next;
cur->next = tmp->next;
tmp->next = cur;
cur = pre->next;
}
return dummy.next;
}
};
// @lc code=end