import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
//汉诺塔问题求解
//假设有a,b,c三个柱子,要将a上的盘子通过b移动到c上
public static void main(String[] args)throws IOException{
Scanner sc=new Scanner(new BufferedReader(new InputStreamReader(System.in)));
System.out.println("请输入要移动的的盘子数:");
int m=sc.nextInt();
HanoiTower(m,'a','b','c');
}
public static void HanoiTower(int n,char a,char b,char c)
{
if(n==1)
{
System.out.println("将盘"+n+"从"+a+"->"+c);
}
else
{
HanoiTower(n-1, a,c,b);
System.out.println("将盘"+n+"从"+a+"->"+c);
HanoiTower(n-1, b,a,c);
}
}
}
输出
请输入要移动的的盘子数:
3
将盘1从a->c
将盘2从a->b
将盘1从c->b
将盘3从a->c
将盘1从b->a
将盘2从b->c
将盘1从a->c