Two stacks implement queues + two queues implement stacks ---- java

Two stacks implement queues + two queues implement stacks ---- java

Two stacks implement queues + two queues implement stacks ---- java

I. Two stacks implement one queue

Train of Thought: All elements enter stack1, and then all come out of stack1 and enter stack2. implement the first-in-first-out of the queue: If stack2 is not empty, what we need exactly happens to be pushed to the top of the stack and then pushed out of the stack; to add an element to the queue, that is, the advanced sack1, if stack2 is not empty, it will be out of the stack. If it is empty, it will all stack stack1 to stack2.

2. Two queues implement one stack

Ps: The image was originally created in Cambridge offer, from the Internet