#147 Insertion Sort List

Description

Given the head of a singly linked list, sort the list using insertion sort, and return the sorted list’s head.

The steps of the insertion sort algorithm:

Insertion sort iterates, consuming one input element each repetition and growing a sorted output list.
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.
It repeats until no input elements remain.
The following is a graphical example of the insertion sort algorithm. The partially sorted list (black) initially contains only the first element in the list. One element (red) is removed from the input data and inserted in-place into the sorted list with each iteration.

Examples

Example 1:

Input: head = [4,2,1,3]
Output: [1,2,3,4]

Example 2:

Input: head = [-1,5,3,4,0]
Output: [-1,0,3,4,5]

Constraints:

The number of nodes in the list is in the range [1, 5000].
-5000 <= Node.val <= 5000

思路

题目要求是插入排序，所以其实问题的关键就在于指针的指向，在纸上写明白之后就好写代码了

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode insertionSortList(ListNode head) {
        ListNode start = new ListNode(0, head);
        
        ListNode unsortedPointer = head;
        
        while(unsortedPointer.next != null) {
            ListNode pointer = start;
            if (unsortedPointer.val < unsortedPointer.next.val){
                unsortedPointer = unsortedPointer.next;
                continue;
            }
            
            while (pointer.next != null && pointer.next.val < unsortedPointer.next.val) {
                pointer = pointer.next;
            }
            ListNode tmp1 = pointer.next;
            ListNode tmp2 = unsortedPointer.next.next;
            
            pointer.next = unsortedPointer.next;
            unsortedPointer.next.next = tmp1;
            unsortedPointer.next = tmp2;
        }
        
        return start.next;
    }
}