由于栈只能在栈顶入栈和出栈,而队列需要在队头出队,队尾入队,所以我们采用双栈来模拟队列。 |
下面我们来简单描述一下整个算法的过程:
1、定义两个栈S1和S2;(其中S1用来入队,S2用来出队)2、入队:直接压入到S1中即可;
3、出队:如果S2为空,则把S1中的所有元素全部弹出并压入到S2中,再弹出S2的栈顶元素;如果S2不为空,则把S2中的栈顶元素直接弹出。 此时直接将S2的栈顶元素弹出即可。
class MyQueue {
private:
stack<int> s1,s2; //s2作为辅助
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
s1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
int t = s2.top();
s2.pop();
return t;
}
/** Get the front element. */
int peek() {
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
return s2.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return s1.empty()&s2.empty();
}
};
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue* obj = new MyQueue();
* obj->push(x);
* int param_2 = obj->pop();
* int param_3 = obj->peek();
* bool param_4 = obj->empty();
*/