works/solutions/leetcode/cpp/147.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

#include <cstddef>

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution
{
public:
    ListNode *insertionSortList(ListNode *head)
    {
        if (head == NULL)
            return NULL;
        if (head->next == NULL)
            return head;

        ListNode *next_sort = head->next;

        head->next = nullptr;

        while (next_sort != nullptr)
        {
            ListNode *current_sort = next_sort;
            next_sort = current_sort->next;

            ListNode *prev = nullptr;
            ListNode *current = head;

            int i = 0;

            while (current != nullptr && current->val < current_sort->val)
            {
                i++;
                prev = current;
                current = current->next;
            }

            if (prev == nullptr)
            {
                current_sort->next = head;
                head = current_sort;
            }
            else
            {
                ListNode *prev_next = prev->next;
                prev->next = current_sort;
                current_sort->next = prev_next;
            }
        }

        return head;
    }
};