汉诺塔 （Java代码）

解题思路:

注意事项:

参考代码:

import java.util.Arrays;

import java.util.Scanner;

public class Main{

static int n, k;

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

n = sc.nextInt();

fun(n,1,2,3,1);

}

//从a到c借助b

private static void fun(int k, int a, int b, int c, int s) {

if(k==1)

System.out.println("Move "+s+" from "+a+" to "+c);

else{

fun(k-1,a,c,b,s);

System.out.println("Move "+(s+k-1)+" from "+a+" to "+c);

fun(k-1,b,a,c,s);

}

}

}