admin管理员组文章数量:1636897
Implement Stack using Queues
Total Accepted: 39756 Total Submissions: 130128 Difficulty: Easy
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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and all test cases.
Subscribe to see which companies asked this question
Hide Tags Stack Design Hide Similar Problems (E) Implement Queue using Stacks
c++ code:
class Stack {
public:
// Push element x onto stack.
void push(int x) {
q1.push(x);
}
// Removes the element on top of the stack.
void pop() {
while(q1.size() > 1) {
int tmp = q1.front();
q1.pop();
q2.push(tmp);
}
q1.pop();
while(!q2.empty()) {
int tmp = q2.front();
q2.pop();
q1.push(tmp);
}
}
// Get the top element.
int top() {
while(q1.size() > 1) {
int tmp = q1.front();
q1.pop();
q2.push(tmp);
}
int ret = q1.front();
int t = q1.front();
q1.pop();
q2.push(t);
while(!q2.empty()) {
int tmp = q2.front();
q2.pop();
q1.push(tmp);
}
return ret;
}
// Return whether the stack is empty.
bool empty() {
return q1.empty() && q2.empty();
}
private:
queue<int> q1,q2;
};
本文标签: implementLeetCodequeuesStack
版权声明:本文标题:LeetCode:Implement Stack using Queues 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dongtai/1729234606a1191852.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论