Leetcode 147. Insertion Sort List-CSDN博客

本文链接：https://blog.csdn.net/ruihuank/article/details/79810666

/**
 * 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* dummyHead = new ListNode(0);
        dummyHead->next = head;
        ListNode* preNode = dummyHead;

        while (preNode->next != nullptr) {
            ListNode* p = dummyHead;
            int val = preNode->next->val;
            while (p->next != preNode->next && p->next->val <= val) {
                p = p->next;
            }

            if (p->next == preNode->next) {
                preNode = preNode->next;

            } else {

                // take off node;
                ListNode* node = preNode->next;
                preNode->next = preNode->next->next;

                // insert node
                ListNode* tmp = p->next;
                p->next = node;
                node->next = tmp;

            }
        }
        return dummyHead->next;

    }
};

/**
 * 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* dummyHead = new ListNode(0);
        dummyHead->next = nullptr;
        ListNode* cur = head;
        ListNode* next = nullptr;
        while (cur != nullptr) {
            next = cur->next;
            ListNode* p = dummyHead;
            while (p->next != nullptr && p->next->val <= cur->val) {
                p = p->next;
            }

            cur->next = p->next;
            p->next = cur;

            cur = next;
        }
        return dummyHead->next;

    }
};