Leetcode 232 Implement Queue using Stacks
来源:互联网 发布:vc界面编程函数 编辑:程序博客网 时间:2024/05/21 22:58
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).
这个还是挺有意思的 值得注意的是可以使用多个stack 并且要注意空栈的特殊情况
另一个用queue表示stack
Leetcode 225 Implement Stack using Queues
class MyQueue { // Push element x to the back of queue. Stack<Integer> in = new Stack(); Stack<Integer> out = new Stack(); public void push(int x) { in.push(x); } // Removes the element from in front of queue. public void pop() { peek();//pop的操作 需要考虑output是否为空栈 out.pop(); } // Get the front element. public int peek() { if(out.empty()){ while(!in.empty()){ out.push(in.pop()); } } return out.peek(); } // Return whether the queue is empty. public boolean empty() { return in.empty() && out.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
- 新博客的第一篇
- 第十五周 字符串长度
- jsonp学习一认识jsonp
- [LeetCode]121. Best Time to Buy and Sell Stock
- 微信小程序开发之麦克风动画 帧动画 放大 淡出
- Leetcode 232 Implement Queue using Stacks
- jsonp学习二验证跨域数据访问
- PostgreSql新手入门命令
- NetBeans启动Tomcat8报“'127.0.0.1' 不是内部或外部命令”启动失败的解决
- Linux驱动修炼之道-SPI驱动框架源码分析(中)
- jsonp学习三jquery-jsonp
- JAVA 入门学习之路-数据源/连接池-DBCP和C3P0。
- 内容(content)、填充(padding)、边框(border)、边界(margin):CSS中盒子模型有何区别?
- java 判断中文的问题