用两个栈实现队列

1.用两个栈实现队列

Leetcode 232；easy；

• 注重代码的规范性、完整性、鲁棒性。
• 采用双栈实现队列，先将数字放入stackPush，然后pop到stackPop栈中，然后pop就是出队列的实现形式;
• 注意两个思想:(1):stackPush中的数据必须一次性全部压入stackPop中;(2):如果stackPop栈不为空，绝不能将stackPush栈中的元素压入stackPop栈，例：stackPop有元素1,2,3，此时stackPush压入了4,5元素，只能Pop完1,2,3，才能Push 5,4元素;

package stack;

import java.util.Stack;

// 两个栈实现队列
class MyQueue {
	Stack<Integer> stackPush;
	Stack<Integer> stackPop;

	/** Initialize your data structure here. */
	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.isEmpty() && stackPush.isEmpty()) {
			throw new RuntimeException("Queue is empty.");
		}
		if (stackPop.isEmpty()) {
			while (!stackPush.isEmpty()) {
				stackPop.push(stackPush.pop());
			}
		}
		return stackPop.pop();
	}

	/** Get the front element. */
	public int peek() {
		if (stackPush.isEmpty() && stackPop.isEmpty()) {
			throw new RuntimeException("Queue is empty.");
		}
		if (stackPop.isEmpty()) {
			while (!stackPush.isEmpty()) {
				stackPop.push(stackPush.pop());
			}
		}
		return stackPop.peek();
	}

	/** Returns whether the queue is empty. */
	public boolean empty() {
		return stackPop.isEmpty() && stackPush.isEmpty();
	}
}

2.用两个队列实现一个栈

Leetcode 225；easy；

package stack;

import java.util.LinkedList;
import java.util.Queue;

class MyStack {
	Queue<Integer> queue1;
	Queue<Integer> queue2;

	/** Initialize your data structure here. */
	public MyStack() {
		queue1 = new LinkedList<>();
		queue2 = new LinkedList<>();
	}

	/** Push element x onto stack. */
	public void push(int x) {
		queue1.add(x);
	}

	/** Removes the element on top of the stack and returns that element. */
	public int pop() {
		if (queue1.isEmpty() && queue2.isEmpty())
			throw new RuntimeException("Queue is empty!");
		if (!queue1.isEmpty()) {
			while (queue1.size() > 1) {
				queue2.add(queue1.remove());
			}
			return queue1.remove();
		}
		while (queue2.size() > 1) {
			queue1.add(queue2.remove());
		}
		return queue2.remove();
	}

	/** Get the top element. */
	public int top() {
		if (queue1.isEmpty() && queue2.isEmpty())
			throw new RuntimeException("Queue is empty!");
		if (!queue1.isEmpty()) {
			while (queue1.size() > 1) {
				queue2.add(queue1.remove());
			}
			return queue1.peek();
		}
		while (queue2.size() > 1) {
			queue1.add(queue2.remove());
		}
		int top = queue2.peek();
		queue1.add(queue2.remove());
		return top;
	}

	/** Returns whether the stack is empty. */
	public boolean empty() {
		return queue1.isEmpty() && queue2.isEmpty();
	}
}