147. Insertion Sort List

最新推荐文章于 2024-06-02 19:59:13 发布

6plus

最新推荐文章于 2024-06-02 19:59:13 发布

阅读量137

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/gcola007/article/details/78599813

版权

Leetcode 专栏收录该内容

90 篇文章 0 订阅

订阅专栏

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) {
        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;
    }
};