//参考了很多网上的代码。。。不是原创
class Solution
{
public:
void push(int node) {
stack1.push(node);
}
int pop() {
int result=0;
int temp=0;
if(stack2.empty())
{
while(!stack1.empty())
{
temp=stack1.top();
stack2.push(temp);
stack1.pop();
}
}
result=stack2.top();
stack2.pop();
return result;
}
private:
stack<int> stack1;
stack<int> stack2;
};