双色Hanoi塔问题-递归

Posted 2021-11-04 nuist__NJUPT

双色Hanoi塔问题-递归

import java.util.Scanner;

public class Hanoi {
    public static void hanoi(int n, String from, String to, String helper){
        if(n == 1){ //递归出口，就1个圆盘
            System.out.println(n + " " + from  + " " + to);
            return ;
        }
        hanoi(n-1, from, helper, to) ; //将n-1个圆盘从A移动到C，B为辅助
        System.out.println(n + " " + from  + " " + to); //将第n个圆盘从A移动到B
        hanoi(n-1, helper, to, from) ; //将n-1个圆盘从C移动到B，A为辅助
    }
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in) ;
        int n = input.nextInt() ;
        hanoi(n, "A", "B", "C") ;
    }
}