Insertion Sort List
Sort a linked list using insertion sort.
第一种直接链表操作,第二种操作链表的值
第一种较麻烦,要考虑在头结点前插入和其他情况,但第一种更高效,而且高效好几倍
第一种(直接链表操作):
第二种(操作链表的值):
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
/*
//交换节点顺序,注意各种插入,麻烦
ListNode *insertionSortList(ListNode *head) {
if(head == NULL || head->next == NULL) return head;
ListNode *pre = head,*p = head;
ListNode *q = head->next;
while(q != NULL){
p = head;
while(p->val < q->val && p->next->val < q->val){
p = p->next;
}
//有序,向后移动
if(p->next == q && p->next->val >= p->val){
pre = q;
q = q->next;
}else{
//在头结点前插入
if(p == head && q->val < p->val){
pre->next = q->next;
q->next = p;
head = q;
q = pre->next;
}
else{
q = insertAfter(head, p,pre,q);
}
}
}
return head;
}
//在节点p后插入节点q
ListNode *insertAfter(ListNode *head, ListNode *p,ListNode *pre,ListNode *q){
ListNode *ret = q->next;
pre->next = q->next;
q->next = p->next;
p->next = q;
return ret;
}
*/
//直接交换值,方便简单
ListNode *insertionSortList(ListNode *head) {
if(head == NULL || head->next == NULL) return head;
ListNode *p = head->next;
while(p!=NULL) {
ListNode * q = head;
while(q->val < p->val) {
q=q->next;
}
if(p!=q) {
int temp = q->val;
q->val = p->val;
while(p!=q) {
q = q->next;
swap(temp, q->val);
}
}
p=p->next;
}
return head;
}
};