用两个栈实现一个队列的功能,用Java实现

import java.util.Stack;

public class QueueByTwoStacks {

	private Stack<Object> stack1;
	private Stack<Object> stack2;
	
	public QueueByTwoStacks() {
		stack1 = new Stack<Object>();
		stack2 = new Stack<Object>();
	}
	
	public static void main(String[] args) {
		QueueByTwoStacks qts = new QueueByTwoStacks();
		
		String[] months = {"January", "February", "March", "April", "May", "June",
		        "July", "August", "September", "October", "November", 
		        "December"};
		
		for(int i = 0; i < months.length; i++){
			qts.offer(months[i]);
		}
		
		for(int i = 0; i < months.length; i++ ){
			System.out.println(qts.poll());
		}
	}
	
	public void offer(Object obj){
		stack1.push(obj);
	}
	
	public Object poll(){
		Object obj = null;
		if(stack2.empty()){
			while(!stack1.empty()){
				stack2.push(stack1.pop());
			}
			obj = stack2.pop();
		}else{
			obj = stack2.pop();
		}
		
		return obj;
	}
}


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值