题目描述
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.
Example:
MyStack stack = new MyStack();
stack.push(1);
stack.push(2);
stack.top(); // returns 2
stack.pop(); // returns 2
stack.empty(); // returns false
Notes:
You must use only standard operations of a queue – which means only push to back, peek/pop from front, size, and is 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).
思路
两个队列实现栈,pop和top操作的时候,用另一个队列存放元素,取最后一个元素的值。
代码
class MyStack {
public:
/** Initialize your data structure here. */
MyStack() {
}
/** Push element x onto stack. */
void push(int x) {
if (que1.empty()) que2.push(x);
else que1.push(x);
}
/** Removes the element on top of the stack and returns that element. */
int pop() {
if (!que1.empty()) swap(que1, que2);
int res;
while(que2.size() > 1) {
res = que2.front();
que1.push(res);
que2.pop();
}
res = que2.front();
que2.pop();
return res;
}
/** Get the top element. */
int top() {
if (!que1.empty()) swap(que1, que2);
int res;
while(!que2.empty()) {
res = que2.front();
que1.push(res);
que2.pop();
}
return res;
}
/** Returns whether the stack is empty. */
bool empty() {
if (que1.empty() && que2.empty()) return true;
return false;
}
private:
queue<int> que1;
queue<int> que2;
};
/**
* Your MyStack object will be instantiated and called as such:
* MyStack* obj = new MyStack();
* obj->push(x);
* int param_2 = obj->pop();
* int param_3 = obj->top();
* bool param_4 = obj->empty();
*/