[leetcode 225] Implement Stack using Queues
来源:互联网 发布:csgo mac-10皮肤 编辑:程序博客网 时间:2024/05/21 08:59
Question:
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.
- You must use only standard operations of a queue -- which means only
push to back
,peek/pop from front
,size
, andis 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).
用两个队列,每次出栈都将que队列中前面的元素移出去到st中,最后一个元素出栈后再将所有数据入队到que中
class Stack {private: queue<int> que,st;public: // Push element x onto stack. void push(int x) { que.push(x); } // Removes the element on top of the stack. void pop() { int n = que.size(); for(int i = 0; i < n-1; i++){ int tem = que.front(); st.push(tem); que.pop(); } que.pop(); while(!st.empty()){ que.push(st.front()); st.pop(); } } // Get the top element. int top() { int n = que.size(); int top; for(int i = 0; i < n-1; i++){ int tem = que.front(); st.push(tem); que.pop(); } top = que.front(); st.push(top); que.pop(); while(!st.empty()){ que.push(st.front()); st.pop(); } return top; } // Return whether the stack is empty. bool empty() { return que.empty(); }};
0 0
- Implement Stack using Queues - LeetCode 225
- LeetCode 225: Implement Stack using Queues
- Leetcode[225]-Implement Stack using Queues
- leetcode 225: Implement Stack using Queues
- leetcode 225 Implement Stack using Queues
- leetcode 225:Implement Stack using Queues
- [Leetcode 225, Easy] Implement Stack using Queues
- LeetCode---(225)Implement Stack using Queues
- leetcode-225-Implement Stack using Queues
- leetCode #225 Implement Stack using Queues
- [leetcode-225]Implement Stack using Queues(c++)
- [LeetCode 225] Implement Stack using Queues
- Leetcode #225 Implement Stack using Queues
- [leetcode 225] Implement Stack using Queues
- Leetcode NO.225 Implement Stack using Queues
- LeetCode(225) Implement Stack using Queues
- LeetCode 225 Implement Stack using Queues
- 【LEETCODE】225-Implement Stack using Queues
- leetcode- Longest Common Prefix
- PhantomRobot
- XMPP框架 微信项目开发之CoreData学习——CoreData的多表关联操作
- Maven学习 (六) 搭建多模块企业级项目
- MFC编程:弹出服务器消息推送对话框
- [leetcode 225] Implement Stack using Queues
- python 分割文件数据
- [urls.py设置技巧]Django是如何处理URLconf的?
- 策略模式
- MyEclipse中JAR System library 怎么更改
- pod update/install 慢
- tomcat Lifecycle设计模式
- 【随机过程】随机过程之更新过程(1)
- 用Python进行SQLite数据库操作