Java汉诺塔

import java.util.Scanner;

public class TowersofHanoi
{
     public static void main(String[] args)
     {
          Scanner input = new Scanner(System.in);
          System.out.print("Enter number of disks: ");
          int n = input.nextInt();
          
          System.out.println("The moves are: ");
          moveDisks(n,'A','B','C');
          
     }
     
     public static void moveDisks(int n,char fromTower,char toTower,char auxTower)
     {
          if(n == 1)                       //结束条件
               System.out.println("Move disk " + n + " from " + fromTower + " to " + toTower);
          else
          {
               moveDisks(n-1,fromTower,auxTower,toTower);              
//将上面n-1个盘子从A搬到C
               System.out.println("Move disk " + n + " from " + fromTower + " to " + toTower); //将第n个从A搬到B
               moveDisks(n-1,auxTower,toTower,fromTower);          
  //将C的n-1个从C搬到B
          } 
     }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值