admin管理员组文章数量:1636910
Implement Stack using Queues
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.
用两个队列即可实现栈。
class Stack {
public:
queue<int>q1,q2;
// Push element x onto stack.
void push(int x) {
q1.push(x);
}
// Removes the element on top of the stack.
void pop() {
while (!q1.empty()) {
if (q1.size() > 1)
q2.push(q1.front());
q1.pop();
}
while (!q2.empty()) {
q1.push(q2.front());
q2.pop();
}
}
// Get the top element.
int top() {
return q1.back();
}
// Return whether the stack is empty.
bool empty() {
return q1.empty();
}
};
class Stack {
public:
queue<int>q1,q2;
// Push element x onto stack.
void push(int x) {
q1.push(x);
}
// Removes the element on top of the stack.
void pop() {
while (!q1.empty()) {
if (q1.size() > 1)
q2.push(q1.front());
q1.pop();
}
while (!q2.empty()) {
q1.push(q2.front());
q2.pop();
}
}
// Get the top element.
int top() {
return q1.back();
}
// Return whether the stack is empty.
bool empty() {
return q1.empty();
}
};
本文标签: LeetCodeimplementqueuesStack
版权声明:本文标题:leetcode-225-Implement Stack using Queues 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dianzi/1729235475a1191940.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论