请用栈实现一个队列,支持如下四种操作:
push(x) – 将元素x插到队尾;
pop() – 将队首的元素弹出,并返回该元素;
peek() – 返回队首元素;
empty() – 返回队列是否为空;
注意:
你只能使用栈的标准操作:push to top,peek/pop from top, size 和 is empty;
如果你选择的编程语言没有栈的标准库,你可以使用list或者deque等模拟栈的操作;
输入数据保证合法,例如,在队列为空时,不会进行pop或者peek等操作;
样例
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false
算法:
直接用两个栈模拟
C++代码
class MyQueue {
public:
stack<int> stk1,stk2;
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
stk1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
while(stk1.size() > 1){
stk2.push(stk1.top());
stk1.pop();
}
int x = stk1.top(); stk1.pop();
while(stk2.size()){
stk1.push(stk2.top());
stk2.pop();
}
return x;
}
/** Get the front element. */
int peek() {
while(stk1.size()){
stk2.push(stk1.top());
stk1.pop();
}
int x = stk2.top();
while(stk2.size()){
stk1.push(stk2.top());
stk2.pop();
}
return x;
}
/** Returns whether the queue is empty. */
bool empty() {
return stk1.empty();
}
};
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue obj = MyQueue();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.peek();
* bool param_4 = obj.empty();
*/