C++实现LeetCode(147.链表插入排序)_C/C++

C++实现LeetCode(147.链表插入排序)

2021-12-07 14:46Grandyang C/C++

这篇文章主要介绍了C++实现LeetCode(147.链表插入排序),本篇文章通过简要的案例,讲解了该项技术的了解与使用,以下就是详细内容,需要的朋友可以参考下

[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

链表的插入排序实现原理很简单，就是一个元素一个元素的从原链表中取出来，然后按顺序插入到新链表中，时间复杂度为 O(n2)，是一种效率并不是很高的算法，但是空间复杂度为 O(1)，以高时间复杂度换取了低空间复杂度，参见代码如下：

									class Solution {

									public:

									    ListNode* insertionSortList(ListNode* head) {

									        ListNode *dummy = new ListNode(-1), *cur = dummy;

									        while (head) {

									            ListNode *t = head->next;

									            cur = dummy;

									            while (cur->next && cur->next->val <= head->val) {

									                cur = cur->next;

									            }

									            head->next = cur->next;

									            cur->next = head;

									            head = t;

									        }

									        return dummy->next;

									    }

									};