LeetCode---(232)Implement Queue using Stacks
来源:互联网 发布:域名泛解析怎么做 编辑:程序博客网 时间:2024/05/19 00:47
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.
堆栈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:
stack<int> stack1; //用作入队
stack<int> stack2; //用作出队
// Push element x to the back of queue.
void push(int x) {
stack1.push(x);
}
void move(){
while(!stack1.empty())
{
int x=stack1.top();
stack1.pop();
stack2.push(x);
}
}
// Removes the element from in front of queue.
void pop(void) {
if (stack2.empty())
move();
if (!stack2.empty())
stack2.pop();
}
// Get the front element.
int peek(void) {
if (stack2.empty())
move();
if(!stack2.empty())
return stack2.top();
}
// Return whether the queue is empty.
bool empty(void) {
return stack1.empty()&&stack2.empty();
}
};
0 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
- 一步步教你Hadoop多节点集群安装配置
- Codeforces Round #312 (Div. 2) ABC题解
- STL中容器的erase()
- 硬件知识
- DB2错误代码
- LeetCode---(232)Implement Queue using Stacks
- Android_APP级别的异常处理
- UVA11059 - Maximum Product
- laravel5学习笔记(三)
- zoj 3635 Cinema in Akiba
- Linux 内存管理之 mmap 解析(一)
- 技术心得六——探索者之歌
- BroadcastReceiver
- CCD工业相机的误差