Leetcode-insertion Sort List

Sort a linked list using insertion sort.

This topic examines LinkedList's knowledge points and the basic concepts of insertion sort. The online approach is to build a dummy node to do the front nodes, each time take unsorted list inside a node, record the next hop position, and then insert this point into the sorted list corresponding position. The Insert Sort method is equivalent to removing the head node from the original list each time, and inserting the head node into the new list in the corresponding position. The new list is all made up of the original nodes, but the order is changed /**

* Definition for singly-linked list. * public class ListNode {* int val; * ListNode Next; * ListNode (int X) {* val = x; * next = NULL; *} *}*/ Public classSolution { PublicListNode insertionsortlist (ListNode head) {ListNode dummy=NewListNode (-1);  while(Head! =NULL) {listnode node=dummy;  while(Node.next! =NULL&& Node.next.val <head.val) {Node=Node.next; }
ListNode Temp=Head.next; Head.next=Node.next; Node.next=Head; Head=temp; }        returnDummy.next; }}

Leetcode-insertion Sort List