163. Delete the Middle of a Stack
Core1000 ms256 MBSolved by 0%
Read n values pushed onto a stack in the order given, delete the middle
element, then print the stack from TOP to bottom.
For an odd n the middle is the single element at position n/2 counting from the
bottom, 0-based. For an even n, delete the LOWER of the two middle elements, position
n/2 - 1.
Print Empty if nothing remains.
Constraints - `1 ≤ n ≤ 100000` - `-1000000 ≤ value ≤ 1000000`
Input
The first line contains an integer n.
The second line contains n space-separated integers, pushed onto the stack in that order, so the LAST value given ends up on top.
Output
Print the remaining stack from TOP to bottom, separated by single spaces, or Empty if nothing remains.
Input5
1 2 3 4 5
Output5 4 2 1
Notedeletes the middle of an odd-sized stack
Input4
1 2 3 4
Output4 3 1
Notedeletes the LOWER middle of an even-sized stack
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.