Leetcode:225. Implement Stack using Queues(JAVA)
来源:互联网 发布:有趣的心理学软件 编辑:程序博客网 时间:2024/05/07 03:29
【问题描述】
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.
【思路】
使用两个队列实现stack操作。
【code】
class MyStack {Queue<Integer> q1 = new LinkedList<Integer>();Queue<Integer> q2 = new LinkedList<Integer>();// Push element x onto stack.public void push(int x) {q1.offer(x);}// Removes the element on top of the stack.public void pop() {while (q1.size() > 1) {q2.offer(q1.poll());}q1.poll();Queue<Integer> temp;temp = q1;q1 = q2;q2 = temp;}// Get the top element.public int top() {while (q1.size() > 1) {q2.offer(q1.poll());}int x = q1.poll();q2.offer(x);Queue<Integer> temp;temp = q1;q1 = q2;q2 = temp;return x;}// Return whether the stack is empty.public boolean empty() {return q1.isEmpty();}}
0 0
- leetcode-java-225. Implement Stack using Queues
- Leetcode:225. Implement Stack using Queues(JAVA)
- 【leetcode】Implement Stack using Queues 【java】
- leetcode oj java Implement Stack using Queues
- leetcode oj java Implement Stack using Queues
- [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题解 225. Implement Stack using Queues
- 【leetcode】225. Implement Stack using Queues
- maven下载jar包不完全解决办法
- 进制转换练习
- 实时显示iOS编写UI代码效果
- queue —— 队列使用示例
- Java中ArrayList和LinkedList区别
- Leetcode:225. Implement Stack using Queues(JAVA)
- 我喜欢的智慧石资源
- (一)java多线程的创建
- Tomcat 7优化前及优化后的性能对比
- 装饰者模式(3)
- 每日一bootstrap 栅格
- ARM程序下载
- window插字符的使用
- C++第一次实验(2)