import java.util.*;
public class Solution {
/**两个栈实现队列*/
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
stack1.push(node);
while (!stack2.isEmpty()) {
stack1.push(stack2.pop());
}
}
public int pop() {
return stack1.pop();
}
}
两个栈实现队列
最新推荐文章于 2024-09-17 14:27:29 发布