[LeetCode]147. Insertion Sort List链表排序

public ListNode insertionSortList(ListNode head) {
        if (head==null||head.next==null) return head;
        ListNode dummy = new ListNode(0);
        ListNode h = head;
        ListNode next;
        ListNode temp;
        while (h!=null)
        {
            next = h.next;
            temp = dummy;
            while (temp.next!=null&&h.val>temp.next.val) {
                temp = temp.next;
            }
            h.next = temp.next;
            temp.next = h;
            h = next;
        }