Java for Lintcode linked list Insert sort

Sort the linked list with insert sort

Problem Solving Ideas:

The most time-saving method is to use the priority queue, but cannot pass, then insert the order directly.

    Public ListNode insertionsortlist (ListNode head) {ListNode root = new ListNode (Integer.min_value), while (head! = null) {Li Stnode temp = Root;while (Temp.next! = null && head.val >= temp.next.val) temp = temp.next;if (temp.next==null) {T Emp.next=head;head=head.next;temp.next.next=null;} Else{listnode temp2 = TEMP.NEXT;TEMP.NEXT=HEAD;HEAD=HEAD.NEXT;TEMP.NEXT.NEXT=TEMP2;}} return root.next;    }

Java for Lintcode linked list Insert sort