力扣232.用栈实现队列

232.用栈实现队列

思路:

准备2个栈：inStack、outStack

入队时，push 到 inStack 中

出队时

✓ 如果 outStack 为空，将 inStack 所有元素逐一弹出，push 到 outStack，outStack 弹出栈顶元素

✓ 如果 outStack 不为空， outStack 弹出栈顶元素

代码实现

class MyQueue {

    private Stack<Integer> inStack;
	private Stack<Integer> outStack;
	
	public MyQueue() {
		inStack = new Stack<>();
		outStack = new Stack<>();
    }
    
	/**
	 * 入队
	 * @param x
	 */
    public void push(int x) {
    	inStack.push(x);
    }
    
    /**
     * 出队
     * @return
     */
    public int pop() {
    	checkOutStack();

    	return outStack.pop();
    }
    
    /**
     * 获取队头
     * @return
     */
    public int peek() {
    	
    	checkOutStack();
    	return outStack.peek();
    }
    
    /**
     * 是否为空
     * @return
     */
    public boolean empty() {
    	return inStack.isEmpty() && outStack.isEmpty();
    }
    
    private void checkOutStack() {
    	if (outStack.isEmpty()) {
    		while (!inStack.isEmpty()) {
    			outStack.push(inStack.pop());
    		}
    	}
    }
}

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * boolean param_4 = obj.empty();
 */