LeetCode 225. Implement Stack using Queues
来源:互联网 发布:阿里云数据同步 编辑:程序博客网 时间:2024/05/21 06:14
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.
- You must use only standard operations of a queue -- which means only
push to back
,peek/pop from front
,size
, andis 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 assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
Update (2015-06-11):
The class name of the Java function had been updated to MyStack instead of Stack.
class Stack {public: queue<int> q; // Push element x onto stack. void push(int x) { queue<int> tmp; while(!q.empty()){ tmp.push(q.front()); q.pop(); } q.push(x); while(!tmp.empty()){ q.push(tmp.front()); tmp.pop(); } } // Removes the element on top of the stack. void pop() { q.pop(); } // Get the top element. int top() { return q.front(); } // Return whether the stack is empty. bool empty() { return q.empty(); }};
0 0
- [leetcode] 225.Implement Stack using Queues
- 【leetcode】 225. Implement Stack using Queues
- <LeetCode OJ> 225. Implement Stack using Queues
- Leetcode 225. Implement Stack using Queues
- 225. Implement Stack using Queues LeetCode
- LeetCode *** 225. Implement Stack using Queues
- 【leetcode】225. Implement Stack using Queues
- LeetCode 225. Implement Stack using Queues
- leetcode-225. Implement Stack using Queues
- leetcode 225. Implement Stack using Queues
- LeetCode-225.Implement Stack using Queues
- leetcode-java-225. Implement Stack using Queues
- Leetcode题解 225. Implement Stack using Queues
- 【leetcode】225. Implement Stack using Queues
- [Leetcode]225. Implement Stack using Queues
- LeetCode 225. Implement Stack using Queues
- LeetCode - 225. Implement Stack Using Queues
- LeetCode 225. Implement Stack using Queues
- Observer观察者模式
- 《大话数据结构》读书笔记
- 关于获取chromium最新源代码的几点疑惑
- 深搜 城堡
- 浅析Java匿名内部类在Android事件响应中的应用
- LeetCode 225. Implement Stack using Queues
- iOS模拟器中修改textField键盘类型为中文输入和键盘弹出方法
- ORACLE数据库---子查询
- 复制的虚拟机 ,找不到网卡eth0了,可能会有其他网卡生效,设置eth0生效
- 接收广播BroadcastReceiver
- java程序中修改properties原始文件
- Eclipse中使用maven构建SpringMVC
- python 类
- 利用JitPack发布Android开源库