【链表】Insertion Sort List

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var insertionSortList = function(head) {
    if(head==null||head.next==null){
        return head;
    }
    
    var tempHead=new ListNode(0),p=head,tp=null;
    
    while(p!=null){
        tp=tempHead;
        while(tp.next!=null&&tp.next.val<p.val){
            tp=tp.next;
        }
        var tempNode1=tp.next;
        var tempNode2=p.next;
        tp.next=p;
        p.next=tempNode1;
        p=tempNode2;
    }
    
    return tempHead.next;
};