leetcode/143.cpp at master · Yashbhatt7/leetcode · GitHub

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
#include<iostream>
#include<vector>

struct ListNode {
    int val;
    ListNode *next;
};

void reorderList(ListNode* head) {
    std::vector<int> vec;

    ListNode* temp = head;
    while (temp != nullptr) {
        vec.push_back(temp->val);
        temp = temp->next;
    }

    std::vector<int> secVec;
    int left = 0;
    int right = vec.size() - 1;

    while (left < right) {
        secVec.push_back(vec[left++]);
        secVec.push_back(vec[right--]);
    }

    if (left == right) {
        secVec.push_back(vec[left]);
    }

    int i = 0;
    while (i < secVec.size()) {
        head->val = secVec[i];
        head = head->next;
        ++i;
    }
}

int main() {


    std::cin.get();
}