链接:leetcode232.用栈实现队列
思路:push时,先把data压入s1,当使用pop,peek,empty的时候再把data从s1中倒腾出来压入s2中
class MyQueue {
public:
stack<int> s1,s2;
MyQueue() {
}
void push(int x) {
s1.push(x);
}
int pop() {
int res=this->peek();
s2.pop();
return res;
}
int peek() {
if(s2.empty()){
while(!s1.empty()){
int ele = s1.top();
s1.pop();
s2.push(ele);
}
}
return s2.top();
}
bool empty() {
while(!s1.empty()){
int ele = s1.top();
s1.pop();
s2.push(ele);
}
return s2.empty();
}
};