public ListNode insertionSortList(ListNode head) {
        if(head == null){
            return head;
        }
        ListNode p = head.next;
        head.next = null;
        while (p!=null) {
            ListNode temp = p.next;
            ListNode sortP = head;
            ListNode sortPParent = null;
            int i = 0;
            while (sortP!=null){
                if(p.val < sortP.val){
                    if(sortPParent !=null){
                        sortPParent.next = p;
                    }
                    p.next = sortP;
                    if(i == 0){
                        head = p;
                    }
                    break;
                }
                sortPParent = sortP;
                if(sortP.next == null){
                    sortP.next=p;
                    p.next=null;
                    break;
                }
                sortP=sortP.next;
                i++;
            }
           p = temp;
        }
        return head;
    }