【leetcode】Insertion Sort List

 1 class Solution {
 2 public:
 3     ListNode* insertionSortList(ListNode* head) {
 4         ListNode *newhead=new ListNode(-1);
 5         while(head!=NULL)
 6         {
 7             //保存head位置
 8             ListNode *tmp=head->next;
 9             ListNode *cur=newhead;
10 
11             while(cur->next!=NULL&&cur->next->val<head->val)
12             {
13                 cur=cur->next;
14             }
15             //插入
16             head->next=cur->next;
17             cur->next=head;
18             //恢复head
19             head=tmp;
20         }
21 
22         return newhead->next;
23     }
24 };