143. Reorder ListMedium
You are given the head of a singly linked-list. The list can be represented as:
L
0
→ L
1
→ … → L
n - 1
→ L
0
Reorder the list to be on the following form:
L
0
→ L
n
→ L
1
→ L
n - 1
→ L
2
→ L
n - 2
→ ...
You may not modify the values in the list's nodes. Only nodes themselves may be changed.
- Problem
- Solutions