Problem Statement
Trace lab in Stacks and Expression Processing
Mission
Push tokens then pop them in reverse order.
Learning outcome: Trace LIFO push and pop order
Correctness contract
Invariant: Only the top element is removed, and size equals pushes minus successful pops.
Required technique: Push every token onto a LIFO stack, then pop to produce the reverse order.
Complexity target: time O(n); space O(n).
Input and output
Input: n followed by exactly n whitespace-delimited tokens. Whitespace may be spaces or line breaks.
Output: Print the requested sequence on one line with single spaces and no trailing space. Return it as a String; Main.java prints it without adding other text.
Assumptions:
- The declared count is non-negative and is followed by exactly that many whitespace-delimited tokens.
Before you code
- Restate the input and output contract, then predict the visible example without running code.
- Implement the core state transition: Push every token onto a LIFO stack, then pop to produce the reverse order.
- Trace the smallest boundary case, verify exact formatting, and justify the authored time and auxiliary-space bounds.
Implement Practice.solve(Scanner sc). Keep every provided filename and public class name unchanged.
Sample input
4 one two three fourSample output
four three two oneWhy the sample works: Visible walkthrough for the ordinary non-trivial path. Tokens leave the stack in the reverse of their push order. Input `4 one two three four` therefore produces `four three two one`.
Progressive hints
Try the trace and first milestone before opening a hint. Open them in order.
Open hint 1Hint 1 β Contract: identify what each parsed variable represents and write the invariant beside the loop or recursive method.
Open hint 2Hint 2 β Next step: Trace the smallest non-trivial input and write the structure state after the operation before coding the loop.
Open hint 3Hint 3 β Verification: compare the structure state before and after one operation, then test the smallest valid input and a duplicate or unreachable case when allowed.