漢諾塔問題——java

package stact;

import java.util.Scanner;

public class Hanoi {
    private static int step;

    /*
    * n表示圓盤的個數
    * x、y、z表示三個基座
    * */
    private static void move(int n, String x, String y,String z) {
        if (n == 0) {
            return;
        }
        move(n - 1,x,z,y);
        System.out.println(step + ":" + n + "號圓盤從" + x + "移動到" + z);
        move(n - 1,y,x,z);
        step ++;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        step = 1;
        move(n,"x","y","z");
    }
}