【年少的风】递归实现汉诺塔

 

import java.util.Scanner;

public class Hanoi {

    private static int n;
    private char A = 'A';
    private char B = 'B';
    private char C = 'C';
    public static void main(String[] args) {

        new Hanoi();
    }

    Hanoi() {

        System.out.print("请输入圆盘的个数 n=");
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();

        hanoi(n,A,B,C);//将 A柱子上的圆盘通过 B柱子转移到 C柱子
    }

    private void hanoi(int n, char A, char B,char C) {

        if(n == 1) {
            move(A,C);
        }
        else {
            hanoi(n-1,A,C,B);
            move(A,C);
            hanoi(n-1,B,A,C);
        }
    }

    private void move(char A,char B) {
        System.out.println(A + "------>" + B);
    }
}