用插排对单向链表进行排序

插排时间复杂度O(N^2),空间复杂度O(1),对数组用插排进行排序，对每个元素，向前插入到合适的位置，数组可以用下标访问，向前访问，但单向链表只能一个方向移动，因此构造辅助链表，代码如下：

/**
 * 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) {
          ListNode* d = new ListNode(0);
          ListNode* cur = head;
          ListNode* pre = d;
          while(cur)
          {
              ListNode* temp = cur->next;//记录当前结点的下一个
              pre = d;
              while(pre->next&&pre->next->val<cur->val) pre=pre->next;
              cur->next = pre->next;//将当前结点next置NULL
              pre->next = cur;//拷贝当前结点
              cur = temp;
          }
        return d->next;
    }
};

利用递归反向插入

class Solution {
public:
 ListNode *insertionSortList(ListNode *head) {
        if(!head || !head->next) return head;
        ListNode dummyHead(0), *p;
        dummyHead.next = insertionSortList(head->next);
        p = &dummyHead;
          
        while(p && p->next && head->val > p->next->val){
            p = p->next;
        }
        head->next = p->next;
        p->next = head;
          
        return dummyHead.next;
    }
};
添加笔记

不用辅助链表

class Solution {
public:
    ListNode *insertionSortList(ListNode *head) {
        if (head == NULL || head->next == NULL) {
            return head;
        }
        ListNode* pB = head->next;
        head->next = NULL;
        ListNode *pA, *temp;
        while (pB != NULL) {
            pA = head;
            if (pB->val < head->val) {
                temp = pB->next;
                //pB->next = head;
                pB->next = pA;
                head = pB;
                pB = temp;
            }
            else {
                while (pA->next != NULL && pA->next->val < pB->val) {
                    pA = pA->next;
            }
            temp = pB->next;
            pB->next = pA->next;
            pA->next = pB;
            pB = temp;
            }
        }
        return head;
    }
};