用Java实现汉诺塔

import java.util.Stack;


public class HanNuoTa {
	
	public static void main(String[] args){
		HanNuoTa hnt = new HanNuoTa(6);
	}
	
	public HanNuoTa(int count){
		this.count = count;
//		try{
//			fout = new FileOutputStream("store.txt");
//			writer = new OutputStreamWriter(fout,"UTF-8");
			hanNuoTa(count,'A','B','C',0);
			//hanNuoTa_stack(count,'A','B','C',0);
//			writer.close();
//			fout.close();
//		}catch(Exception e){
//			e.printStackTrace();
//		}
	}
	/**
	 * 
	 * @param n 汉诺塔的规模n
	 * @param start 汉诺塔的起点
	 * @param transit 汉诺塔的中转节点
	 * @param destination 汉诺塔的终点
	 * @param level 迭代的深度,初始深度为0
	 */
	private void hanNuoTa(int n,char start,char transit,char destination,int level){
		if(n == 1){
			move(n,start,destination);
			return;
		}
		level++;
		hanNuoTa(n-1,start,destination,transit,level);
		move(n,start,destination);
		hanNuoTa(n-1,transit,start,destination,level);
	}
	private class Element{
		public int n,level;
		public char start,transit,destination;
		
		public Element(int n,char start,char transit,char destination,int level){
			this.n = n;
			this.start = start;
			this.transit = transit;
			this.destination = destination;
			this.level = level;
		}
	}
	
	private void hanNuoTa_stack(int n,char start,char transit,char destination,int level){
		Stack<Element> stack = new Stack();
		stack.push(new Element(n,start,transit,destination,level));
		while(!stack.empty()){
			Element e = stack.pop();
			if(e.n == 1){
				move(e.start,e.destination);
			}else{
				stack.push(new Element(n-1,e.transit,e.start,e.destination,level));
				move(e.start,e.destination);
				stack.push(new Element(n-1,e.start,e.destination,e.transit,level));
			}
			e = null;
		}
	}
	
	/**
	 * 显示效果:
	 * move 1 from A to B
	 * move 2 from A to C 
	 * @param mark 节点的标识或名称
	 * @param start 移动的起点标识或名称
	 * @param destination 移动的终点标识或名称
	 */
	private void move(int mark,char start,char destination){
		StringBuffer sb = new StringBuffer();
		sb.append("move ");
		sb.append(mark);
		sb.append(" from ");
		sb.append(start);
		sb.append(" to ");
		sb.append(destination);
		sb.append("\r\n");
		System.out.print(sb.toString());
//		try{
//			writer.write(sb.toString());
//		}catch(Exception e){
//			e.printStackTrace();
//		}
		sb.delete(0,sb.length());
	}
	
	private void move(char start,char destination){
		StringBuffer sb = new StringBuffer();
		sb.append("move ");
		sb.append("the top disk from ");
		sb.append(start);
		sb.append(" to ");
		sb.append(destination);
		sb.append("\r\n");
		System.out.print(sb.toString());
		sb.delete(0,sb.length());
	}
//	private Writer writer;
//	private FileOutputStream fout ;
	private int count;//初始规模
}
 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值