//漢諾塔問題
//HanYang 2016/10/15

import java.util.Scanner;

//輸出
public class Hanuota {
?public static void Show(String a,String b){
??System.out.print(" " + a + "->" + b + " " );
?}

//從a移到c
??? public static void Fun(int n, String a,String b,String c){
??? ?if(n<1)
??? ??System.out.println("input error,please input integer(bigger than 1):");
??? ?else if(n == 1)
??? ??System.out.print( " " + a + "->" + c );
??? ?else{
??? ??Fun(n-1,a,c,b);
??? ??Show(a,c);
??? ??Fun(n-1,b,a,c);
??? ?}?
??? }
?public static void main(String[] args) {
??// TODO Auto-generated method stub
????? Scanner in = new Scanner(System.in);
????? int m;
????? System.out.println( "please input the number of Hanoi:");
????? m = in.nextInt();
????? String a,b,c;
????? System.out.println( "please input the name of three pillars:");
????? a = in.next();
????? b = in.next();
????? c = in.next();
????? Fun(m,a,b,c);
?}

}

轉(zhuǎn)載于:https://www.cnblogs.com/shouhutian/p/5966265.html

總結(jié)

以上是生活随笔為你收集整理的java 解决汉诺塔问题的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。