147. Insertion Sort List
Problem:
思路:
Solution (C++):
ListNode* insertionSortList(ListNode* head) {
if (!head) return NULL;
ListNode node(INT_MIN);
using L = ListNode*;
L newHead = &node, prev = &node, nex = &node;
while (head) {
L temp = head;
prev = &node;
nex = &node;
while (nex && temp->val >= nex->val) {
prev = nex;
nex = nex->next;
}
prev->next = temp;
head = head->next;
temp->next = nex;
}
return newHead->next;
}
性能:
Runtime: 60 ms Memory Usage: 8.6 MB
思路:
Solution (C++):
性能:
Runtime: ms Memory Usage: MB
相关链接如下:
知乎:littledy
GitHub主页:https://github.com/littledy
github.io:https://littledy.github.io/
欢迎关注个人微信公众号:小邓杂谈,扫描下方二维码即可
作者:littledy
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接,否则保留追究法律责任的权利。