java代码--汉诺塔

文件名称: HanoiTower.java

package firststudy;
/**
 * 汉诺塔问题:
 * @author web
 *
 */
public class HanoiTower {
	static int count = 1 ;							//计算移动次数
	public static void main(String[] args) {
		move(3, 'A', 'B', 'C');
	}
	
	public static void move(int level, char a, char b, char c) {		
		if( level == 1) {
			System.out.println("第" + (count++) + "步 :" + "将  盘子 1 从  " + a + " 移动到  " + c);
		} else {
			move(level - 1, a, c, b);
			System.out.println("第" + (count++) + "步 :" + "将  盘子 "+ level + " 从  " + a + " 移动到  " + c);
			move(level - 1, b, a, c);
		}
	}
}

运行结果: