对链表进行插入排序
代码:
/**
* 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 || !head->next)
return head;
ListNode dummy(INT_MIN); //方便指针统一处理
ListNode *cur = head; //遍历原链表的指针
ListNode *p = &dummy; //新链表当前节点指针
while(cur)
{
ListNode *temp;
while (p->next && p->next->val < cur->val) //在新链表中找到插入的位置
p = p->next;
temp = cur->next; //保存就链表的下一个位置
cur->next = p->next;
p->next = cur;
cur = temp;
p = &dummy; //恢复指针p,为下一步从新链表的开头重新开始查找做准备
}
return dummy.next;
}
};