Shulou(Shulou.com)06/02 Report--

This article mainly explains "how to use the queue to implement the stack". The content in the article is simple and clear, and it is easy to learn and understand. Please follow the editor's train of thought to study and learn "how to use the queue to implement the stack".

Use queues to implement the following actions of the stack:

Push (x)-- element x stacks

Pop ()-removes the top element of the stack

Top ()-- get the top element of the stack

Empty ()-returns whether the stack is empty

Note:

You can only use the basic operations of the queue-that is, push to back, peek/pop from front, size, and is empty-these operations are legal.

The language you are using may not support queues. You can use list or deque (double-ended queue) to simulate a queue, as long as it is a standard queue operation.

You can assume that all operations are valid (for example, pop or top operations are not called on an empty stack).

Class MyStack {LinkedList queue1 = new LinkedList (); / * * Initialize your data structure here. * / public MyStack () {} / * * Push element x onto stack. * / public void push (int x) {queue1.addLast (x);} / * * Removes the element on top of the stack and returns that element. * / public int pop () {return queue1.removeLast ();} / * * Get the top element. * / public int top () {return queue1.getLast ();} / * * Returns whether the stack is empty. * / public boolean empty () {return queue1.isEmpty ();}} Thank you for reading. The above is the content of "how to implement stack with queues". After the study of this article, I believe you have a deeper understanding of how to use queues to implement stacks, and the specific usage needs to be verified in practice. Here is, the editor will push for you more related knowledge points of the article, welcome to follow!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.