关于栈的学习-04

[leetcode] 232:用栈实现队列

问题描述

使用栈实现队列的下列操作：
-> push(x) – 将一个元素放入队列的尾部。
-> pop() – 从队列首部移除元素。
-> peek() – 返回队列首部的元素。
-> empty() – 返回队列是否为空。
示例

MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);  
queue.peek();  // 返回 1
queue.pop();   // 返回 1
queue.empty(); // 返回 false

java程序如下

class MyQueue {

    /** Initialize your data structure here. */
    /**压入栈*/
	public Stack<Integer> stackPush;
	/**弹出栈*/
	public Stack<Integer> stackPop;
    public MyQueue() {
        stackPush = new Stack<Integer>() ;
		stackPop = new Stack<Integer>() ;
    }
    /** Push element x to the back of queue. */
    public void push(int x) {
        /**执行压入操作*/
		stackPush.push(x);
    }
    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        /**执行弹出操作*/
		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();
    }
    /** Get the front element. */
    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();
    }
    
    /** Returns whether the queue is empty. */
    public boolean empty() {
        return (stackPush.isEmpty() && stackPop.isEmpty()); 
    }
}
/**
 * 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();
 */