[LeetCode]Implement Queue using Stacks
来源:互联网 发布:python编写一个小程序 编辑:程序博客网 时间:2024/05/01 13:52
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 {private: stack<int> stack1; stack<int> stack2;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()){ int temp = stack1.top(); stack1.pop(); stack2.push(temp); } stack2.pop(); } } // Get the front element. int peek(void) { if(!stack2.empty()){ return stack2.top(); } else{ while(!stack1.empty()){ int temp = stack1.top(); stack1.pop(); stack2.push(temp); } return stack2.top(); } } // Return whether the queue is empty. bool empty(void) { return stack1.empty()&&stack2.empty(); }};
0 1
- 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
- [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
- Java序列化
- 路径规划PgRouting
- 九章算法面试题77 插入区间
- Linux操作系统基础命令、快捷键
- 排序算法之二路归并排序
- [LeetCode]Implement Queue using Stacks
- 算法导论 第十六章:贪心算法之单任务调度问题
- 【从零单排之微软面试100题系列】12之求1+2+3+…+n
- CAGradientLayer功能
- KVC的使用
- Ubuntu下安装ARM交叉编译器过程
- UVA 11752-The Super Powers
- IOS AutoLayout详解(二)-多动图详解
- Happy Number