这是我最开始的想法,我大概花了一个小时才做出来,太慢了,我的思路是使用递归的方法,从后面往前面排序,比如:2,3,1 第一次递归变为 : 2,1,3 ,第二次递归变为:1,2,3 。但是时间花得太久了,80ms左右;
class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
if(head == NULL || head->next == NULL)
{
return head;
}
ListNode* rest = insertionSortList(head->next);
ListNode* current = head;
int cur = head->val;
while(rest != NULL && cur > rest->val)
{
current->val = rest->val;
current = current->next;
rest = rest->next;
}
current->val = cur;
return head;
}
};
最后在discuss中发现了这个方法,惊为天人,这个方法是先申请一个辅助点newhead,newhead的下一个节点就是head,先预先判断一次head是否是顺序,当顺序时O(n),当有一个点不是顺序时,将这个点重新排序,并在原来的地点删除这个点,链表直接插入就可以了,但是如果是数组就得按我的方法,一个一个移动已经排好序的节点:
class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
ListNode* new_head = new ListNode(0);
new_head -> next = head;
ListNode* pre = new_head;
ListNode* cur = head;
while (cur) {
if (cur -> next && cur -> next -> val < cur -> val) {
while (pre -> next && pre -> next -> val < cur -> next -> val)
pre = pre -> next;
/* Insert cur -> next after pre.*/
ListNode* temp = pre -> next;
pre -> next = cur -> next;
cur -> next = cur -> next -> next;
pre -> next -> next = temp;
/* Move pre back to new_head. */
pre = new_head;
}
else cur = cur -> next;
}
ListNode* res = new_head -> next;
delete new_head;
return res;
}
};