经典汉诺塔java

package Action;

public class demo {

	public static void hanio(int n, String A, String B, String C) {
		if (n < 1) {
			System.out.println("汉诺塔的层数不得小于一");
		} else if (n == 1) { // 递归出口
			System.out.println("移动：" + A + "——》" + C);
			return;
		} else { // 核心移动三步
			hanio(n - 1, A, C, B);
			System.out.println("移动：" + A + "——》" + C);
			hanio(n - 1, B, A, C);
		}
	}

	public static void main(String args[]) {
		String a = "a";
		String b = "b";
		String c = "c";
		hanio(3, a, b, c);
	}
}