leetcode刷题（225）——用队列实现栈

最新推荐文章于 2022-07-31 11:33:49 发布

/*chen*/

最新推荐文章于 2022-07-31 11:33:49 发布

阅读量387

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/weixin_39722922/article/details/89512013

版权

本文介绍了如何利用队列来模拟栈的push、pop、top和empty操作。关键在于当一个队列为空时，将另一个队列的所有元素倒入当前空队列。避免了在pop和top操作时才移动元素导致的超时问题。

摘要由CSDN通过智能技术生成

Implement the following operations of a stack using queues.

push(x) -- Push element x onto stack.

pop() -- Removes the element on top of the stack.

top() -- Get the top element.

empty() -- Return whether the stack is empty.

Example:
MyStack stack = new MyStack();

stack.push(1);
stack.push(2);  
stack.top();   // returns 2
stack.pop();   // returns 2
stack.empty(); // returns false
Notes:

You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.

Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.

You may