class Solution
{
public:
void push(int node)
{
stack1.push(node);
}
int pop()
{
int a;
if(stack2.empty())
{
while(!stack1.empty())
{
a=stack1.top();
stack2.push(a);
stack1.pop();
}
}
a=stack2.top();
stack2.pop();
return a;
}
private:
stack<int> stack1;
stack<int> stack2;
};
用两个栈实现队列
最新推荐文章于 2024-02-21 17:10:17 发布