【LeetCode】 232. Implement Queue using Stacks
来源:互联网 发布:量子计算机 ibm 知乎 编辑:程序博客网 时间:2024/06/06 13:07
Implement the following operations of a queue using stacks.
- push(x) -- Push element x to the back of queue.
- pop() -- Removes the element from in front of queue.
- peek() -- Get the front element.
- empty() -- Return whether the queue is empty.
- You must use only standard operations of a stack -- which means only
push to top
,peek/pop from top
,size
, andis empty
operations are valid. - Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
- You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
class MyQueue { private Stack<Integer> stack = new Stack<Integer>(); // Push element x to the back of queue. public void push(int x) { Stack<Integer> temp = new Stack<Integer>(); while (!stack.isEmpty()) { temp.push(stack.pop()); } stack.push(x); while(!temp.isEmpty()) { stack.push(temp.pop()); } } // Removes the element from in front of queue. public void pop() { stack.pop(); } // Get the front element. public int peek() { return stack.peek(); } // Return whether the queue is empty. public boolean empty() { return stack.isEmpty(); }}
0 0
- [LeetCode]232.Implement Queue using Stacks
- 【leetcode】232. Implement Queue using Stacks
- <LeetCode OJ> 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks LeetCode
- Leetcode: 232. Implement Queue using Stacks(JAVA)
- leetcode 232. Implement Queue using Stacks
- LeetCode *** 232. Implement Queue using Stacks
- 【leetcode】232. Implement Queue using Stacks
- LeetCode 232. Implement Queue using Stacks
- Leetcode题解 232. Implement Queue using Stacks
- #leetcode#232. Implement Queue using Stacks
- leetcode 232. Implement Queue using Stacks
- Leetcode 232. Implement Queue using Stacks
- leetcode 232. Implement Queue using Stacks
- LeetCode-232.Implement Queue using Stacks
- 【leetcode】232. Implement Queue using Stacks
- [leetcode] 232. Implement Queue using Stacks
- LeetCode - 232. Implement Queue using Stacks
- 使用eclipse编译含有C++11特性的代码
- weerrrr
- 简单n!
- 通过js获取表单数据
- Log4net 日志文件的操作
- 【LeetCode】 232. Implement Queue using Stacks
- 【CEPH】ceph集群性能测试fio
- 与素数有关的知识---模版
- C#中的文件处理
- Spring学习之旅(六) 表单校验以及Spring标签库的使用
- 钱能解决的都是小事——北漂18年(78)
- 大端模式和小端模式
- SSD读写速度测试
- java递归遍历目录