LeetCode 225. Implement Stack using Queues
来源:互联网 发布:扬州淘宝美工培训学校 编辑:程序博客网 时间:2024/05/07 03:17
description:
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.
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 assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
使用queue结构进行实现stack结构,需要处理最后面的一个元素。使用该元素时,要注意两个queue的相互交换等一些问题的处理技巧。
public class MyStack { Queue<Integer> queue1; Queue<Integer> queue2; /** Initialize your data structure here. */ public MyStack() { queue1 = new LinkedList<Integer>(); queue2 = new LinkedList<Integer>(); } private void p2p() { int len = queue1.size() - 1; for (int i = 0; i < len; i++) { queue2.offer(queue1.poll()); } } private void swapQueue() { Queue temp = queue1; queue1 = queue2; queue2 = temp; } /** Push element x onto stack. */ public void push(int x) { queue1.offer(x); } /** Removes the element on top of the stack and returns that element. */ public int pop() { p2p(); int temp = queue1.poll(); swapQueue(); return temp; } /** Get the top element. */ public int top() { p2p(); int temp = queue1.poll(); swapQueue(); queue1.offer(temp); return temp; } /** Returns whether the stack is empty. */ public boolean empty() { return queue1.isEmpty(); }}/** * Your MyStack object will be instantiated and called as such: * MyStack obj = new MyStack(); * obj.push(x); * int param_2 = obj.pop(); * int param_3 = obj.top(); * boolean param_4 = obj.empty(); */
- [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
- 【codevs1033】蚯蚓的游戏问题
- IOS开发之OC篇(6)——NSFileManager文件管理器
- PADS 快捷键
- Vue 2.0 介绍与指令
- 【codevs1227】[网络流24题]方格取数 2
- LeetCode 225. Implement Stack using Queues
- memcache的优缺点
- 读书笔记 effective c++ Item 8 不要让异常(exceptions)离开析构函数
- 二月英语总结
- dump命令--Linux命令应用大词典729个命令解读
- HTML-表格标签
- arm-linux安装Ubuntu12.4开发环境(二)安装tftp server
- RabbitMQ的几种典型使用场景(很有用的一篇文章)
- Google让三个AI一起玩对抗游戏,其中两个学会如何“防偷听”