用两个栈来实现一个队列,完成队列的Push和Pop操作。 队列中的元素为int类型。
import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.push(node);
}
public int pop() {
if(stack1.empty())
return 0;
else{
int node;
while(!stack1.empty()){
node = stack1.peek();
stack1.pop();
stack2.push(node);
}
int result = stack2.peek();
stack2.pop();
while(!stack2.empty()){
node = stack2.peek();
stack2.pop();
stack1.push(node);
}
return result;
}
}
}