汉诺塔递归实现——Java代码

在递归中不断重复以下步骤: 若要将N层从X转移到Z,则需要将N-1层从X转移到Y,再将第N层从X转移到Z,最后将N-1层从Y转移到Z;将N层从从X转移到Y、Y转移到Z、Y转移到X、Z转移到X、Z转移到Y也类似。
返回条件:N == 1时,第N层直接转移到Z。(从X转移到Z情况)

以下N=5时运行的结果:
这里写图片描述

import java.util.Scanner;

public class HanoiTower 
{
    private int steps = 0;
    public HanoiTower(){}

    public int getSteps(){
        return steps;
    }
    public void printXToZ(int num){
        if(num == 1){
            System.out.print(num + "->Z  ");
            steps++;
            return;
        }
        printXToY(num - 1);
        System.out.print(num + "->Z  ");
        steps++;
        printYToZ(num - 1);
    }

    public void printYToZ(int num){
        if(num == 1){
            System.out.print(num + "->Z  ");
            steps++;
            return;
        }
        printYToX(num - 1);
        System.out.print(num + "->Z  ");
        steps++;
        printXToZ(num - 1);
    }

    public void printYToX(int num){
        if(num == 1){
            System.out.print(num + "->x  ");
            steps++;
            return;
        }
        printYToZ(num - 1);
        System.out.print(num + "->x  ");
        steps++;
        printZToX(num - 1);
    }

    public void printZToX(int num){
        if(num == 1){
            System.out.print(num + "->x  ");
            steps++;
            return;
        }
        printZToY(num - 1);
        System.out.print(num + "->x  ");
        steps++;
        printYToX(num - 1);
    }

    public void printXToY(int num){
        if(num == 1){
            System.out.print(num + "->y  ");
            steps++;
            return;
        }
        printXToZ(num - 1);
        System.out.print(num + "->y  ");
        steps++;
        printZToY(num - 1);
    }

    public void printZToY(int num){
        if(num == 1){
            System.out.print(num + "->y  ");
            steps++;
            return;
        }
        printZToX(num - 1);
        System.out.print(num + "->y  ");
        steps++;
        printXToY(num - 1);
    }
    public static void main(String[] args) 
    {
        int num;
        Scanner scanner = new Scanner(System.in);
        System.out.println("Please input the floors of HanoiTower:");
        num = scanner.nextInt();
        HanoiTower hanoiTower = new HanoiTower();

        hanoiTower.printXToZ(num);//将汉诺塔从X位置移到Z位置
        System.out.println();
        System.out.println("Steps:" + hanoiTower.getSteps());
    }
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值