[leetcode 147] Insertion Sort List

最新推荐文章于 2025-12-27 20:58:23 发布

原创最新推荐文章于 2025-12-27 20:58:23 发布 · 327 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Sort #Linked List

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

本文介绍了一种使用插入排序算法对单链表进行排序的方法，详细解释了链表节点的定义，并通过实现一个名为Solution的类来演示排序过程。

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 dummy(-1);
        dummy.next = head;
        ListNode *prev = &dummy;
        for (auto first = prev->next ; first; ) {
            ListNode *second = dummy.next;
            ListNode *pre_second = &dummy;
            for (; second != first; pre_second = second, second =  second->next) {
                if (second->val > prev->next->val) {
                    prev->next = prev->next->next;
                    first->next = second;
                    pre_second->next = first;
                    first = prev->next;
                    break;
                }
            }
            if (second == first) {
                prev = prev->next;
                first = prev->next;
            }
        }
        return dummy.next;
    }
};