LeetCode-147-Insertion Sort List
Posted 无名路人甲
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
解题思路:插入排序。
ListNode* insertionSortList(ListNode* head) { if(head==nullptr || head->next==nullptr) return head; ListNode* dup = new ListNode(-1); ListNode* cur = head; while(cur!=nullptr){ ListNode* prev = dup; while( prev->next!=nullptr && prev->next->val < cur->val) prev= prev->next; ListNode* temp = prev->next; prev->next = cur; cur=cur->next; prev->next->next=temp; } return dup->next; }
以上是关于LeetCode-147-Insertion Sort List的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode-147-Insertion Sort List
LeetCode 147. Insertion Sort List
Leetcode 147. Insertion Sort List 插入排序 in Java
leetcode 147 Insertion Sort List