问题描述:
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).
用队列来实现栈的功能,实现起来比较容易,直接上代码:
class MyStack {
public:
queue<int> q;
/** Initialize your data structure here. */
MyStack() {
}
/** Push element x onto stack. */
void push(int x) {
q.push(x);
}
/** Removes the element on top of the stack and returns that element. */
int pop() {
int res = top();
int size = q.size();
for(int i = 0;i < (size - 1); i++)
{
q.push(q.front());
q.pop();
}
q.pop();
return res;
}
/** Get the top element. */
int top() {
if(!q.empty())
{
return q.back();
}
return 0;
}
/** Returns whether the stack is empty. */
bool empty() {
return q.empty();
}
};