题目描述:
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
利用插入排序对链表排序,每次从输入取出一个元素,在排好序的链表中查找插入的位置,然后插入。
class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
ListNode* result=new ListNode(INT_MIN);
while(head!=NULL)
{
int x=head->val;
ListNode* p=result;
ListNode* pre_p=result;
while(p!=NULL&&x>=p->val)
{
pre_p=p;
p=p->next;
}
ListNode* insert_node=new ListNode(x);
pre_p->next=insert_node;
insert_node->next=p;
head=head->next;
}
return result->next;
}
};