题解 | #用两个栈实现队列#
用两个栈实现队列
https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
static int stack[1000];
int head = 0;
int tail = 0;
int push(int node)
{
if(tail > 1000)
{
tail = 0;
}
stack[tail++] = node;
return 0;
}
int pop(int node)
{
return node = stack[head++];
}
