reorder-list 1.0.0
Reorder List
Loading...
Searching...
No Matches
Solution Class Reference

Public Member Functions

void reorderList (ListNode *head)
 

Detailed Description

Definition at line 17 of file main.cpp.

Member Function Documentation

◆ reorderList()

void Solution::reorderList ( ListNode head)
inline

Definition at line 20 of file main.cpp.

21 {
22 if (head == nullptr)
23 return;
24 deque<int> val_deque;
25 ListNode* current = head->next;
26 while (current != nullptr)
27 {
28 val_deque.push_back(current->val);
29 current = current->next;
30 }
31 current = head;
32 while (!val_deque.empty())
33 {
34 current->next = new ListNode(val_deque.back());
35 val_deque.pop_back();
36 current = current->next;
37 if (!val_deque.empty())
38 {
39 current->next = new ListNode(val_deque.front());
40 val_deque.pop_front();
41 current = current->next;
42 }
43 }
44 current->next = nullptr;
45 return;
46 }
Definition for singly-linked list.
Definition main.cpp:9
int val
Definition main.cpp:10
ListNode * next
Definition main.cpp:11

References ListNode::next, and ListNode::val.


The documentation for this class was generated from the following file: