用栈来实现队列

用栈来实现队列

---

---

import java.util.Stack;

//public class main {
//    public static void main(String[] args) {
//
//    }
//}

class MyQueue {
    Stack<Integer> inStack = new Stack<>();
    Stack<Integer> outStack = new Stack<>();

    public MyQueue() {
    }

    public void push(int x) {
        inStack.push(x);
    }

    public int pop() {
        if (outStack.empty() == true && inStack.empty() == true) {
            empty();
        }
        dump();
        return outStack.pop();
    }

    public int peek() {
        if (outStack.empty() == true && inStack.empty() == true) {
            empty();
        }
        dump();
        return outStack.peek();
    }


    public boolean empty() {
        if (inStack.empty() == true && outStack.empty() == true) {
            return true;
        }
        return false;
    }

    public void dump() {
        if (outStack.empty() == true && inStack.empty() != true) {
            while (inStack.empty() != true) {
                outStack.push(inStack.pop());
            }
        }
    }
}


//当 inStack 和 outStack 都为空的时候，则队列empty
//当inStack 不为空，而outStack为空的时候，则全部dump进去
//其他两种情况，不管不顾。不痛不痒。