【leetcode】【medium】147. Insertion Sort List

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:

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

题目链接：https://leetcode.com/problems/insertion-sort-list/

思路

在array中实现插入排序很简单，在list中实现的难点在于没有指向上一节点的指针。

重点在于设计变量：

1.哨兵节点：值为INT_MIN，使得list头部和中部操作统一。

2.tail指针：记录已排序list的最后一个节点位置，next指向NULL。

3.head：当前待插入的节点。

4.tmp：寻找可插入位置。

5.next：下一轮待插入的节点。

----- 

通过这题看出我对插入排序算法没有达到了如指掌，所以本不难的题，却在完成时对于到底需要记录哪些变量这点上出了错。

一个小trick：记录已排序list的tail，让新元素先和tail比大小，能避免正好插入tail后面时的重复操作。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* insertionSortList(ListNode* head) {
        if (head==NULL || head->next==NULL) return head;
        ListNode* node = new ListNode(INT_MIN);
        ListNode* tail = node;
        while(head!=NULL){
            if(tail->val <= head->val){
                tail->next = head;
                tail = tail->next;
                head = head->next;
                tail->next = NULL;
            }else{
                ListNode* tmp = node, *next = head->next;
                while(tmp->next != NULL){
                    if(tmp->next->val <= head->val){
                        tmp = tmp->next;
                    }else{
                        head->next = tmp->next;
                        tmp->next = head;
                        break;
                    }
                }
                head = next;
            }
        }
        return node->next;
    }
};