Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.push(node);
}
public int pop() {
while(!stack1.isEmpty()){
stack2.push(stack1.pop());
}
int val = stack2.pop();
while(!stack2.isEmpty()){
stack1.push(stack2.pop());
}
return val;
}
用两个栈实现队列
最新推荐文章于 2024-07-25 16:35:35 发布