Sort a linked list using insertion sort

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

/*void insertionSort(int *a,int n){
    for(int j = 2;j<n;j++){
        i = j-1;
        int key = a[j];
        while(i>=0&&a[i]>key){
            a[i+1] = a[i];
            i--;
        }
        a[i+1] = key;
    }
}*/

//将head作为有序链表，将head->next作为待插入的链表

class Solution {
public:
    ListNode *insertionSortList(ListNode *head)
    {
        if(head == NULL||head->next ==NULL) return head;
        //if(!head) return head;
        
        ListNode temp(0);//define a dummyHead
        ListNode *p,*q,*t;
        while(head)
        {
            p = &temp;
            q = p->next;
            t = head;
            head = head->next;
            while(q&&q->val<t->val)
            {
                p = p->next;
                q = q->next;
            }  
            p->next = t;
            t->next = q;
        }
        return temp.next;
    }
};