147. Insertion Sort List

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode insertionSortList(ListNode head) {
        if (head == null)  {
            return head;
        }
        // Ref : https://leetcode.com/discuss/24663/an-easy-and-clear-way-to-sort-o-1-space
        ListNode helper = new ListNode(0); // new starter of the sroted list 
        ListNode cur = head; // the node will be inserted
        
        ListNode pre = helper; // insert node betweeen pre and pre.next
        ListNode next = null;  // the next ndoe will be inserted
        
        // not the end of input list
        while (cur != null) {
            next = cur.next;  //3
            // find the right place to insert
            while (pre.next != null && pre.next.val < cur.val) {
                pre = pre.next;
            }
            // insert between pre and pre.next
            cur.next = pre.next;
            pre.next = cur;  //1
            pre = helper;
            cur = next; //3
        }
        return helper.next;
    }
}