store/works/solutions/leetcode/cpp/86.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

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

class Solution
{
public:
    ListNode *partition(ListNode *head, int x)
    {
        if (head == nullptr)
            return nullptr;

        if (head->next == nullptr)
        {
            return head;
        }

        ListNode less_list_head(0);
        ListNode greater_list_head(0);

        ListNode *less_list_tail = &less_list_head;
        ListNode *greater_list_tail = &greater_list_head;

        auto current_head = head;
        auto prev = head;
        auto current = head->next;
        bool less = head->val < x;

        while (current != nullptr)
        {
            const bool current_less = (current->val < x);
            if (less != current_less)
            {
                if (less)
                {
                    less_list_tail->next = current_head;
                    less_list_tail = prev;
                }
                else
                {
                    greater_list_tail->next = current_head;
                    greater_list_tail = prev;
                }

                less = current_less;
                current_head = current;
            }
            prev = current;
            current = current->next;
        }

        if (less)
        {
            less_list_tail->next = current_head;
            less_list_tail = prev;
        }
        else
        {
            greater_list_tail->next = current_head;
            greater_list_tail = prev;
        }

        less_list_tail->next = greater_list_head.next;
        greater_list_tail->next = nullptr;

        return less_list_head.next;
    }
};