题解 | 对链表进行插入排序

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
struct ListNode* insertionSortList(struct ListNode* head ) {
    struct ListNode *dummy=malloc(sizeof(struct ListNode));
    dummy->next=head;
    struct ListNode *curr=head->next;
    struct ListNode *front;
    struct ListNode *tail=head;
   
    
    while(curr!=NULL)
    {
        if(tail->val<=curr->val)
        {
            tail=tail->next;
        }else 
        {
            front= dummy;  
            while(curr->val>=front->next->val)front=front->next;

            tail->next=curr->next;
            curr->next=front->next;
            front->next=curr;
        
        }
        curr=tail->next;
    }
    


    return dummy->next;

}