[LeetCode147]Insertion Sort List（链表插入排序）

/**
 * 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 *dummy=new ListNode(-1), *ans, *ret=new ListNode(-1);
		//dummy原链表的附加头节点,ans答案链表的附加头结点,ret答案链表的最后一个节点
		ListNode *cur=head, *tmp, *pre;//cur原链表的第一个节点,tmp原链表值最小的节点,pre最小节点的前一个节点
		dummy->next=head;
		int size=0;
		while(cur)
		{
			size++;
			cur=cur->next;
		}
		for(int i=0; i<size; i++)
		{
			cur=tmp=dummy->next;pre=dummy;
			while(cur->next)
			{
				if(cur->next->val<tmp->val)
				{
					tmp=cur->next;
					pre=cur;
				}
				cur=cur->next;
			}
			pre->next=tmp->next;
			ret->next=tmp;
			if(i==0) ans=ret;
			ret=ret->next;
		}
		return ans->next;
    }
};