LeetCode---(225)Implement Stack using Queues
来源:互联网 发布:好的机箱推荐 知乎 编辑:程序博客网 时间:2024/05/17 23:54
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).
用两个队列模拟一个堆栈:
队列a和b
(1)取栈顶元素: 返回有元素的队列的首元素
(2)判栈空:若队列a和b均为空则栈空
(3)入栈:a队列当前有元素,b为空(倒过来也一样)则将需要入栈的元素先放b中,然后将a中的元素依次出列并入列倒b中。(保证有一个队列是空的)
(4)出栈:将有元素的队列出列即可。
比如先将1插入队a中 ,现在要将2入栈,则将2插入b总然后将a中的1出列入到b中,b中的元素变为 2 ,1
a为空,现在要压入3 则将3插入a中 ,依次将b中的2 ,1 出列并加入倒a中 ,a中的元素变为 3,2,1 b为空
算法保证在任何时候都有一队列为空
class Stack {public: queue<int> queue1; queue<int> queue2; // Push element x onto stack. void push(int x) { if(queue1.empty()) { queue1.push(x); while(!queue2.empty()) { int temp=queue2.front(); queue2.pop(); queue1.push(temp); } }else{ queue2.push(x); while(!queue1.empty()) { int temp=queue1.front(); queue1.pop(); queue2.push(temp); } } } // Removes the element on top of the stack. void pop() { if(!queue1.empty()) queue1.pop(); if(!queue2.empty()) queue2.pop(); } // Get the top element. int top() { if(!queue1.empty()) return queue1.front(); if(!queue2.empty()) return queue2.front(); } // Return whether the stack is empty. bool empty() { return queue1.empty() && queue2.empty(); }};
0 0
- Implement Stack using Queues - LeetCode 225
- 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, Easy] 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(c++)
- [LeetCode 225] Implement Stack using Queues
- Leetcode #225 Implement Stack using Queues
- [leetcode 225] Implement Stack using Queues
- Leetcode NO.225 Implement Stack using Queues
- LeetCode(225) Implement Stack using Queues
- LeetCode 225 Implement Stack using Queues
- 【LEETCODE】225-Implement Stack using Queues
- 换个地方感到很反感
- navigationBar setBackgroundImage和setBarTintColor区别
- matlab中句柄图性对像的设置
- Linux中RPM包安装、查询、卸载
- 黑马程序员
- LeetCode---(225)Implement Stack using Queues
- 机器学习(一)开源资料库整理--国外全英课程
- poj 1463
- python技巧总结--持续更新
- Apache 安装
- Objective-C中的Runtime机制
- Android 软件开发之如何使用Eclipse Debug调试程序详解
- Qt中qApp
- Android中使用Volley开源库进行Http网络请求(POST方式)