[LeetCode] Insertion Sort List

[LeetCode] Insertion Sort List

Sort a linked list using insertion sort.

/*** Definition for singly-linked list. * public class ListNode {* int val; * ListNode next; * ListNode (int x) {* val = x; * next = null; *} */public class Solution {public ListNode insertionSortList (ListNode head) {if (head = null) return head; int insert = 0; ListNode nextLeft = head; while (true) {// The node (including left) on the left of left is to be traversed and inserted, and right is the nodeListNode left = nextLeft to be inserted; if (left = null) break; Lis TNode right = left. next; if (right = null) break; ListNode rnext = right. next; // if (right. val