class Solution
{
public:
void push(int node) {
stack1.push(node);
}
int pop() {
if(stack2.empty())
while(!stack1.empty())
{
int temp = stack1.top();
stack1.pop();
stack2.push(temp);
}
int ret = stack2.top();
stack2.pop();
return ret;
}
private:
stack<int> stack1;//入队列的栈
stack<int> stack2;//出队列的栈
};