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:
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* dummy = new ListNode(0); dummy->next = head; ListNode* prev = dummy; ListNode* cur = head; while (cur) { if (cur->next && cur->val > cur->next->val) { while (prev->next && prev->next->val < cur->next->val) prev = prev->next; ListNode* tmp = prev->next; prev->next = cur->next; cur->next = prev->next->next; prev->next->next = tmp; prev = dummy; } else { cur = cur->next; } } return dummy->next; } };
[LeetCode] Insertion Sort List
原文：https://www.cnblogs.com/immjc/p/9025828.html