对链表进行插入排序

class Solution {
public:
    ListNode* insertionSortList(ListNode* head) {
        ListNode*dummy=new ListNode(-1,head);
        ListNode*ok=head;
        while(ok->next){
            ListNode*cur=ok->next,*nex=ok->next->next,*i=dummy;
            while(i->next->val<cur->val){
                i=i->next;
            }
            ListNode*pre=i->next;
            if(i==ok)ok=ok->next;
            else{
                i->next=cur;
                ok->next=nex;
                cur->next=pre;
            }
            //if(cur->val==0)cout<<i->val<<ok->val;
        }
        return dummy->next;
    }
};