Sort a linked list using insertion sort.
A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.
With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list
Algorithm of Insertion Sort:
- Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.
- At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
- It repeats until no input elements remain.
Example 1:
Input: 4->2->1->3 Output: 1->2->3->4
Example 2:
Input: -1->5->3->4->0 Output: -1->0->3->4->5
/** * 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 == NULL || head->next == NULL) return head; ListNode* dummyhead = new ListNode(0); ListNode* pre = dummyhead; ListNode* cur = head; while(cur != NULL) { ListNode* next = cur->next; //维护链表的下一个结点 pre = dummyhead; //重置pre为新链表头开始 //在当前排好的新链表中找到第一个大于cur->val的结点 while(pre->next != NULL && pre->next->val <= cur->val) { pre = pre->next; } //当前pre的next结点的值大于cur的值,将cur插入到pre后 cur->next = pre->next; pre->next = cur; cur = next; //cur指向原链表的下一个节点 } return dummyhead->next; } };