设置两个栈,一个用来负责输入,另一个用来负责输出。对于push操作就是将元素压入输入栈即可。empty操作则是判断两个栈是否同时为空。
peek和pop操作大同小异。那就是如果输出栈为空,则要先将输入栈的元素全部弹出并按照弹出顺序再压入到输出栈中,此时在输出栈中,从栈顶到栈底的顺序就是队列中从队头到队尾的顺序。从而只需返回或者弹出输出栈的栈顶元素即可。
具体代码如下:
class MyQueue {
public:
/** Initialize your data structure here. */
stack<int> sinput; //输入栈,负责输入数据和向输出栈中导入数据
stack<int> soutput; //输出栈,负责取队头元素和出队操作
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
sinput.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if(!soutput.empty()){
int t = soutput.top();
soutput.pop();
return t;
}
while(!sinput.empty()){
soutput.push(sinput.top());
sinput.pop();
}
int t = soutput.top();
soutput.pop();
return t;
}
/** Get the front element. */
int peek() {
if(!soutput.empty()) return soutput.top();
while(!sinput.empty()){
soutput.push(sinput.top());
sinput.pop();
}
return soutput.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return sinput.empty() && soutput.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();
*/