参照题解,重用pop
class MyQueue {
public:
stack<int> in;
stack<int> out;
MyQueue() {
}
void push(int x) {
in.push(x);
}
int pop() {
if(out.empty())
{
while(!in.empty())
{
out.push(in.top());
in.pop();
}
}
int res=out.top();
out.pop();
return res;
}
int peek() {
int res=this->pop();
out.push(res);
return res;
}
bool empty() {
return (in.empty()&&out.empty());
}
};
class MyStack {
public:
queue<int>que;
MyStack() {
}
void push(int x) {
que.push(x);
}
int pop() {
int size=que.size();
size--;
while(size--)
{
que.push(que.front());
que.pop();
}
int res=que.front();
que.pop();
return res;
}
int top() {
int res=que.back();
return res;
}
bool empty() {
return que.empty();
}
};