147. Insertion Sort List

Problem:

Sort a linked list using insertion sort.

A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.
With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list
 

Algorithm of Insertion Sort:

1. Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.
2. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
3. It repeats until no input elements remain.

Example 1:

Input: 4->2->1->3
Output: 1->2->3->4

Example 2:

Input: -1->5->3->4->0
Output: -1->0->3->4->5

Analysis:

本题要求讲一个数组进行插入排序，每一个新插入的节点与链表中的所有节点都需要一一进行比对，根据大小进行排列。代码如下：

Code:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode insertionSortList(ListNode head) {
        if(head == null || head.next == null)
            return head;
        ListNode res = new ListNode(-1);
        ListNode p = head;
        while(p != null) {
            ListNode temp = new ListNode(p.val);
            // insert into new linked list
            ListNode q = res.next, pre = res;
            
            if(q != null) {
                while(q != null) {
                    if(q.val > p.val) {
                        pre.next = temp;
                        temp.next = q;
                        break;
                    }
                    pre = q;
                    q = q.next;
                }             
                if(q == null) {
                    pre.next = temp;
                }
            } else {
                res.next = temp;
            }
            
            // Next node
            p = p.next;
        }
        
        return res.next;
    }
}