LeetCode No.225 Implement Stack using Queues
来源:互联网 发布:javascript注释方法 编辑:程序博客网 时间:2024/06/15 18:05
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).
Update (2015-06-11):
The class name of the Java function had been updated to MyStack instead of Stack.
===================================================================
题目链接:https://leetcode.com/problems/implement-stack-using-queues/
题目大意:用队列来实现栈的基本操作。
思路:使用双向队列。
参考代码:
class Stack {public: // Push element x onto stack. void push(int x) { dq.push_back ( x ) ; } // Removes the element on top of the stack. void pop() { if ( ! dq.empty() ) dq.pop_back() ; } // Get the top element. int top() { return dq.back() ; } // Return whether the stack is empty. bool empty() { return dq.empty() ; }private: deque <int> dq ;};
0 0
- Leetcode NO.225 Implement Stack using Queues
- LeetCode--No.225--Implement Stack using Queues
- LeetCode No.225 Implement Stack using Queues
- 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(225) Implement Stack using Queues
- 关于静态构造函数和BeforeFieldInit
- studio项目中import module报错
- Retrofit的使用,及介绍,Retrofit中的各种方法的详细描述简单案例,三分钟学会Retrofit
- java集合18--Iterator和Enumeration比较
- bzoj1619(搜索)
- LeetCode No.225 Implement Stack using Queues
- 2016-11-11
- POJ3080 基本字符串库函数的应用 ..Brute Force/朴素模式匹配算法
- 关于扩展欧几里得的一点研究
- PHPstorm 2016.2汉化
- Properties属性 相关代码写法列举
- Android群英传——第三章Android控件架构
- Java反射笔记整理
- JS-事件处理程序