重拾算法之剑指Offier——用两个栈实现队列

剑指Offier——用两个栈实现队列

import java.util.Stack;

public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();

public void push(int node) {

while (!stack2.empty()){
stack1.push(stack2.peek());
stack2.pop();
}
stack1.push(node);

}

public int pop() {
while (!stack1.empty()){
stack2.push(stack1.peek());
stack1.pop();
}
int peek = stack2.peek();
stack2.pop();
return peek;

}
}