题解 | #用两个栈实现队列#

不同于官方题解的小白题解

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

        public void push(int node) {
            if (stack2.isEmpty()) {
                stack1.push(node);
                stack2.push(node);
            } else {
                int count = 0;
                while (!stack2.isEmpty()) {
                    stack1.push(stack2.pop());
                    count++;
                }
                stack2.push(node);
                while (count != 0) {
                    stack2.push(stack1.pop());
                    count--;
                }
                stack1.push(node);
            }
        }

        public int pop() {
            return stack2.pop();
        }
    }