LeetCode 147：Insertion Sort List

最新推荐文章于 2020-11-20 10:30:38 发布

原创最新推荐文章于 2020-11-20 10:30:38 发布 · 171 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法题

本文详细介绍了如何使用插入排序算法对链表进行排序，通过逐步迭代，每次从输入数据中移除一个元素，并将其正确地插入到已排序的链表中。提供了C++代码示例，展示了算法的具体实现过程。

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

C++ 
ListNode* insertionSortList(ListNode* head) {
        if(head == nullptr||head->next == nullptr)
            return head;
        ListNode* dummy = new ListNode(-1);
        ListNode* pre = head;
        ListNode* cur = pre->next;
        dummy->next = head;
        while(cur)
        {
            ListNode* temp = dummy;
            if(cur->val < pre->val)
            {
                while(temp->next->val < cur->val)
                    temp = temp->next;
                pre->next = cur->next;
                cur->next = temp->next;
                temp->next = cur;
                cur = pre->next;
            }
            else
            {
                cur = cur->next;
                pre = pre->next;
            }
        }
        return dummy->next;
    }