LeetCode题解——Implement Queue using Stacks
来源:互联网 发布:清代档案文献数据库 编辑:程序博客网 时间:2024/06/03 17:23
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 Queue {public: // Push element x to the back of queue. void push(int x) { stack1.push(x); } // Removes the element from in front of queue. void pop(void) { if(!stack2.empty()) stack2.pop(); else{ while(!stack1.empty()){ stack2.push(stack1.top()); stack1.pop(); } if(stack2.empty()) throw(" Queue is empty! "); stack2.pop(); } } // Get the front element. int peek(void) { if(!stack2.empty()) return stack2.top(); else{ while(!stack1.empty()){ stack2.push(stack1.top()); stack1.pop(); } if(stack2.empty()) throw(" Queue is empty! "); return stack2.top(); } } // Return whether the queue is empty. bool empty(void) { if(stack1.empty() && stack2.empty()) return true; return false; }private: stack<int> stack1; stack<int> stack2;};
0 0
- LeetCode题解——Implement Queue using Stacks
- LeetCode题解:Implement Queue using Stacks
- LeetCode 题解(190): Implement Queue using Stacks
- Leetcode题解 232. Implement Queue using Stacks
- leetcode——232——Implement Queue using Stacks
- leetcode解题报告232——Implement Queue using Stacks
- leetcode刷题日记——Implement Queue using Stacks
- LeetCode 之 Implement Queue using Stacks — C++ 实现
- leetcode :Implement Queue using Stacks
- [LeetCode] Implement Queue using Stacks
- LeetCode Implement Queue using Stacks
- LeetCode || Implement Queue using Stacks
- leetcode Implement Queue using Stacks
- Leetcode Implement Queue using Stacks
- [LeetCode]Implement Queue using Stacks
- 【Leetcode】Implement Queue using Stacks
- LeetCode Implement Queue using Stacks
- Leetcode: Implement Queue using Stacks
- 定制自己的SolrRequestHandler
- cf581d
- [LeetCode-35] Search Insert Position(二分法)
- ZOJ2562 More Divisors
- eclipse中导入项目出现小红叉却找不到错误之处的解决办法
- LeetCode题解——Implement Queue using Stacks
- Stack Overflow 最流行的编程语言和标签
- Android读取SD卡.TXT文本内容
- IOS 绘图坐标系颠倒问题
- PHP编程效率的20个要点
- json转xml
- 排序和查找
- [转载]Cocos2d-x 类COC手游与RTS(即时战略)游戏的编程实践总结
- 类的初始化顺序:实例化一个类的对象和访问静态域或者静态方法时的不同