解题思路:
注意事项:
参考代码:
import java.util.Scanner;
public class Demo2056 {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
while (scanner.hasNext()) {
int n=scanner.nextInt();
Hannuota(n,"1","3","2");
}
}
//string from代表的是原木柱
//string to代表的是目标木柱
//string help代表的是辅助木柱
public static void Hannuota(int n,String from,String to,String help) {
if (n==1) {
System.out.println("Move "+n+" from "+from+" to "+to);
}
//将其前n-1个圆筒放在辅助木柱上,将最后一个盘子放在目标木柱,再将辅助木柱的前n-1个盘子移动到目标木柱上
else {
Hannuota(n-1,from,help,to);//将其中的n-1个盘子移动到辅助盘子中
System.out.println("Move "+n+" from "+from+" to "+to);//将第n个盘子移动到c盘子中
Hannuota(n-1,help, to, from);//将前n-1个盘子放入到c盘子中
}
}
}
0.0分
0 人评分