leetcode #147. Insertion Sort List

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:

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.

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

思路
看了一个很清楚的讲解讲解
简单说就是插入排序用linkedlist实现
先用一个dummy 连接head

设一个cur 来检查 cur是否 《= cur.next.val
如果小于则有序 cur = cur.next

设一个pre = null； pre 的作用：当发现这个数不在该在的位置，从前向后遍历，找到她该在的位置把数插进去

/**
 * 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 dummy = new ListNode(-1);
        dummy.next =head;
        ListNode cur = head;
        ListNode prev = null;//检查插入的位置
        ListNode temp = null;// 记录要排序的值
        
        while(cur != null && cur.next!= null){
            if(cur.val <= cur.next.val){
                cur =cur.next;
            }
            else{
                temp = cur.next;
                cur.next =cur.next.next;
                 prev =dummy;
                
                while(prev.next.val <= temp.val){
                    prev = prev.next;
                }
                //如果prev下一个点大于temp 则把他插入到其后
                temp.next = prev.next;
                prev.next = temp;
                
            }
            
        }
        
        return dummy.next;
    }
}