递归 汉诺塔问题java实现
package Digui1zijibiande;
import java.util.Scanner;
//递归 汉诺塔问题
public class S2 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
hanoi(n,'A','B','C');
}
private static void hanoi(int n, char c, char d, char e) {
if(n==1) {
System.out.println(c+"-->"+e);
return;
}
hanoi(n-1,c,e,d);
System.out.println(c+"-->"+e);
hanoi(n-1,d,c,e);
return;
}
}