操作方法
源代码 package edu.test.ch6; public class HanoiTower { public static void moveDish(int level, char from, char inter, char to) { if (level == 1) { System.out.println("from: " + from + " 1 号 to: " + to); } else { moveDish(level - 1, from, to, inter); System.out.println("from: " + from + " " + level + " 号 to: " + to); moveDish(level - 1, inter, from, to); } } public static void main(String[] args) { int nDisks = 5; moveDish(nDisks, 'A', 'B', 'C'); } }
运行结果
分析算法
分析算法
分析算法
分析算法
分析算法