Jan 14, 2024 · Jan 13, 2024 · Jan 13, 2024
diff --git a/java/0147-insertion-sort-list.java b/java/0147-insertion-sort-list.java
 class Solution {
    public ListNode insertionSortList(ListNode head) {
        ListNode dummy = new ListNode(0, head);

        ListNode prev = head;
        ListNode cur = head.next;
        while (cur != null) {
            if (prev.val <= cur.val) {
                prev = cur;
                cur = cur.next;
            } else {
                ListNode elem = dummy;
                while (elem.next.val < cur.val) {
                    elem = elem.next;
                }

                prev.next = cur.next;
                cur.next = elem.next;
                elem.next = cur;

                cur = prev.next;
            }
        }

        return dummy.next;
    }
 }
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,27 @@
		class Solution {
		public ListNode insertionSortList(ListNode head) {
		ListNode dummy = new ListNode(0, head);

		ListNode prev = head;
		ListNode cur = head.next;
		while (cur != null) {
		if (prev.val <= cur.val) {
		prev = cur;
		cur = cur.next;
		} else {
		ListNode elem = dummy;
		while (elem.next.val < cur.val) {
		elem = elem.next;
		}

		prev.next = cur.next;
		cur.next = elem.next;
		elem.next = cur;

		cur = prev.next;
		}
		}

		return dummy.next;
		}
		}