store/works/solutions/leetcode/cpp/328.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

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

class Solution
{
public:
    ListNode *oddEvenList(ListNode *head)
    {
        if (head == nullptr)
            return nullptr;

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

        ListNode *odd_head = head;
        head = head->next;
        ListNode *even_head = head;
        head = head->next;

        ListNode *odd_current = odd_head;
        ListNode *even_current = even_head;

        bool odd = true;
        while (head != nullptr)
        {
            if (odd)
            {
                odd_current->next = head;
                odd_current = head;
            }
            else
            {
                even_current->next = head;
                even_current = head;
            }
            head = head->next;
            odd = !odd;
        }

        odd_current->next = even_head;
        even_current->next = nullptr;

        return odd_head;
    }
};