两个栈实现队列

来源:互联网 发布:上海炫踪 知乎 编辑:程序博客网 时间:2024/06/04 17:40
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(stack2.empty()){          while(!stack1.empty())              stack2.push(stack1.pop());          }          return stack2.pop();    }}