[leetcode]Implement Stack using Queues
来源:互联网 发布:网络数据传输流程 编辑:程序博客网 时间:2024/06/05 18:21
题目如下:
Implement the following operations of a stack using queues.
push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
empty() – Return whether the stack is empty.
Notes:
You must use only standard operations of a queue – which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
就是对java中queue的复习,附上代码:
class MyStack { private Queue<Integer> myqueue; MyStack(){ myqueue = new LinkedList<Integer>(); } // Push element x onto stack. public void push(int x) { Queue tmp = new LinkedList<Integer>(); tmp.add(x); while(myqueue.size() != 0){ int data = myqueue.poll(); tmp.add(data); } myqueue = tmp; } // Removes the element on top of the stack. public void pop() { myqueue.poll(); } // Get the top element. public int top() { return myqueue.peek(); } // Return whether the stack is empty. public boolean empty() { return myqueue.size() == 0; }}
题目链接:`https://leetcode.com/problems/implement-stack-using-queues/
- [LeetCode]Implement Stack using Queues
- [LeetCode] Implement Stack using Queues
- [leetcode] Implement Stack using Queues
- LeetCode Implement Stack using Queues
- #leetcode#Implement Stack using Queues
- Leetcode: Implement Stack using Queues
- [LeetCode] Implement Stack using Queues
- [Leetcode]Implement Stack using Queues
- leetcode--Implement Stack using Queues
- LeetCode Implement Stack using Queues
- LeetCode || Implement Stack using Queues
- Leetcode Implement Stack using Queues
- LeetCode Implement Stack using Queues
- [leetcode] Implement Stack using Queues
- Leetcode: Implement Stack using Queues
- LeetCode-Implement Stack using Queues
- LeetCode Implement Stack using Queues
- Leetcode: Implement Stack using Queues
- Linux内存管理之mmap详解
- 字节数组和字符串相互转换
- 内存泄露从入门到精通三部曲之常见原因与用户实践
- 获取自定义主题(attr.xml)中的定义的图片(Drawable)
- Oracle执行计划不走索引的原因总结
- [leetcode]Implement Stack using Queues
- android很多图片做成帧动画造成内存溢出的解决方法。
- Python 字符串操作方法大全
- CPP中解决伪共享
- jsp页面中,<%! %>的感叹号是干什么用的?
- 漏洞:Password type input with auto-complete enabled
- 论文的语言
- 使用mvn命令构建java项目
- UGUI - 中设置UISprite图片灰显方法