LeetCode 232: Implement Queue using Stacks
来源:互联网 发布:幕墙计算软件 编辑:程序博客网 时间:2024/05/03 05:43
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).
题目要求通过栈来模拟队列的行为。与此类似的还有通过队列模拟栈(http://blog.csdn.net/sunao2002002/article/details/46482673),此题是算法导论第十章的一道题。算法如下:
堆栈a和b,a用作入队,b出队
(1)判队满:如果a满且b不为空,则队满
(2)判队空:如果a和b都为空,则队空
(3)入队:首先判队满。
若队不满:(1)栈a若不满,则直接压入栈a
(2)若a满,则将a中的所有元素弹出到栈b中,然后再将元素入栈a
(4)出队:(1)若b空就将a中的所有元素弹出到栈b中,然后出栈
(2)b不空就直接从b中弹出元素
代码如下:class Queue {public:// Push element x to the back of queue.stack<int> in;stack<int> out;void push(int x) {in.push(x);}void move(){while(!in.empty()){int x = in.top();in.pop();out.push(x);}}// Removes the element from in front of queue.void pop(void) {if (out.empty()){move();}if (!out.empty()){out.pop();}}// Get the front element.int peek(void) {if (out.empty()){move();}if (!out.empty()){return out.top();}}// Return whether the queue is empty.bool empty(void) {return in.empty() && out.empty();}};
1 0
- leetcode 232:Implement Queue using Stacks
- LeetCode 232: Implement Queue using Stacks
- Implement Queue using Stacks(leetcode 232)
- [Leetcode 232, Easy] 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 NO.232 Implement Queue using Stacks
- LeetCode(232) Implement Queue using Stacks
- LeetCode 232 Implement Queue using Stacks
- LeetCode 232:Implement Queue using Stacks
- android源码使用proguard混淆编译及错误总结
- linux 下 hadoop ssh协议免登录原理的介绍
- android studio 使用细节
- D的小L
- Android各个support library特征和区别(官方文档)
- LeetCode 232: Implement Queue using Stacks
- device not managed by NetworkManager
- Activity的启动方式和flag详解[刚哥的]
- appcan 在子窗口中关闭窗口
- 初学C语言之结构体
- SQL_CASE WHEN &临时表 &xml to table 混合实例
- Notifiation通知的一些知识
- 一次单片机最小系统的调试
- 最小生成树-Prim算法和Kruskal算法