使用插入排序算法对单链表进行排序。
/**
* 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)
return NULL;
ListNode *newhead = head;
head = head->next;
newhead->next = NULL;//勿忘。否则会死循环。
while(head != NULL)
{
ListNode *p = head;
head = head->next;
if(newhead->val >= p->val)
{
p->next = newhead;
newhead = p;
}
else
{
ListNode *q = newhead;
while(q->next != NULL && q->next->val < p->val)
q = q->next;
p->next = q->next;
q->next = p;
}
}
return newhead;
}
};