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