问题描述
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.
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).
思路分析
用队列(先进先出)来实现一个栈(后进先出)的基本操作,包括push(),pop(),top()和empty()。
empty():直接使用queue.empty()
top():queue.front()
pop():queue.pop()
push():要保持push进来的元素始终位于队列的最前面,就在每次push元素进入队列的时候,将队列之前的所有元素pop出来,重新push到新元素的后面。
代码
递归
class MyStack {
public:
/** Initialize your data structure here. */
queue<int> que;
MyStack() {
}
/** Push element x onto stack. */
void push(int x) {
que.push(x);
for (int i = 0;i < que.size() - 1;i++){
que.push(que.front());
que.pop();
}
}
/** Removes the element on top of the stack and returns that element. */
int pop() {
int n = que.front();
que.pop();
return n;
}
/** Get the top element. */
int top() {
return que.front();
}
/** Returns whether the stack is empty. */
bool empty() {
return que.empty();
}
};
/**
* 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();
*/
时间复杂度:
??
空间复杂度:
O(1)
反思
一开始考虑是否可以直接push元素,将队列尾作为栈顶,后来发现对于队尾元素没法很好的处理,作罢。