汉诺塔问题

最新推荐文章于 2022-08-04 16:17:38 发布

hust_tank

最新推荐文章于 2022-08-04 16:17:38 发布

阅读量98

点赞数

分类专栏：算法文章标签：汉诺塔算法

本文链接：https://blog.csdn.net/piyongduo3393/article/details/84650939

版权

算法专栏收录该内容

14 篇文章 1 订阅

订阅专栏

package com.tank.practice.basicClass;

public class Code_28_Hanoi {//汉诺塔问题
    public static void hanoi(int n) {
        if (n > 0) {
            hanoiCore(n,"left","right","mid");
        }
    }

    public static void hanoiCore(int n, String from, String to, String help) {
        if (n == 1) {
            System.out.println("Move 1 from " + from + " to " + to);
        } else {
            hanoiCore(n - 1, from, help, to);
            System.out.println("Move " + n + " from " + from + " to " + to);
            hanoiCore(n - 1, help, to, from);
        }
    }

    public static void main(String[] args) {
        hanoi(3);

    }

}