使用两个栈来实现队列

栈：先进后出

队列：先进先出

/*-
 * 两个栈实现队列
 * @author Administrator
 *
 */
public class StaticToQueue {
	Stack<Integer> stack1 = new Stack<>();//保存原数据
	Stack<Integer> stack2 = new Stack<>();//做逆序使用
	public void push(int node) {
		stack1.push(node);
	}
	public void pop() {
		if(stack1.isEmpty()) {
			return;
		}else {
			while(!stack1.isEmpty()) {
				stack2.push(stack1.pop());
			}
			System.out.println(stack2.pop());
			while(!stack2.isEmpty()) {
				stack1.push(stack2.pop());
			}
		}
	}
	public static void main(String[] args) {
		StaticToQueue staticToQueue = new StaticToQueue();
		staticToQueue.push(1);
		staticToQueue.push(2);
		staticToQueue.push(3);
		staticToQueue.push(4);
		staticToQueue.pop();
		staticToQueue.pop();
		staticToQueue.pop();
		staticToQueue.pop();
		staticToQueue.pop();
		
	}
	
}