题目大意:对链表进行插入排序
代码:
/**
* 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) return NULL;
ListNode* dummy = new ListNode(0);
dummy->next = head;
ListNode* tmp;
ListNode* pre = head;
ListNode* p = head->next;
while(p){ //从第二个结点开始,尝试将每个结点插入到之前排好序的链表中
if(p->val >= pre->val){ //当前结点已经比升序最大值大,无需插入操作
pre = pre->next;
p = p->next;
}
else{
tmp = dummy;
while(tmp->next->val <= p->val){
tmp = tmp->next;
}
pre->next = p->next;
p->next = tmp->next;
tmp->next = p;
p = pre->next;
}
}
return dummy->next;
}
};