1栈和队列--由两个栈组成队列

功能：支持队列的基本操作（add压入队列，poll将队首返回并移除，peek获取队首）

public void add(int pushInt) {
            stackPush.push(pushInt);
        }

        public int poll() {//删除并返回队首元素
            if (stackPop.empty() && stackPush.empty()) {
                throw new RuntimeException("Queue is empty!");
            } else if (stackPop.empty()) {
                while (!stackPush.empty()) {
                    stackPop.push(stackPush.pop());
                }
            }
            return stackPop.pop();
        }

        public int peek() {
            if (stackPop.empty() && stackPush.empty()) {
                throw new RuntimeException("Queue is empty!");
            } else if (stackPop.empty()) {
                while (!stackPush.empty()) {
                    stackPop.push(stackPush.pop());
                }
            }
            return stackPop.peek();
        }