Insertion Sort List (M)
題目
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
題意
對給定的鏈表進行插入排序，
思路
遍歷原鏈表，每次將當前結點從原鏈表中取出，插入到新鏈表對應的位置即可，
代碼實作
Java
class Solution {
public ListNode insertionSortList(ListNode head) {
ListNode dummy = new ListNode(0);
while (head != null) {
// 將每一個原結點斷開并取出
ListNode p = head;
head = head.next;
p.next = null;
// 插入到新鏈表中
ListNode pre = dummy, cur = dummy.next;
while (cur != null && cur.val < p.val) {
cur = cur.next;
pre = pre.next;
}
p.next = cur;
pre.next = p;
}
return dummy.next;
}
}
JavaScript
/**
* @param {ListNode} head
* @return {ListNode}
*/
var insertionSortList = function (head) {
let dummy = new ListNode()
while (head) {
let node = head
head = head.next
node.next = null
let pre = dummy
let cur = dummy.next
while (cur && cur.val < node.val) {
cur = cur.next
pre = pre.next
}
node.next = cur
pre.next = node
}
return dummy.next
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/199687.html
標籤：其他
上一篇：【程式人生】業務，有bug