汉诺塔（TowerofHanoi）问题--java

代码摘自《Java语言程序设计（基础篇）》

问题描述

利用C，将A中的由小到大排列的盘子，移动到B中。且移动过程中。小盘子始终防止大盘子的上方

import java.util.Scanner;//借助B，将A中的n个盘子移动到Cpublic class TowerofHanoi {public static void main(String[] args){Scanner input =new Scanner(System.in);System.out.println("please input disks num : ");int disks=input.nextInt();moveDisk(disks,'A','C','B');}private static void moveDisk(int disks, char fromPan , char midPan, char toPan) {// TODO Auto-generated method stubif(disks==1)System.out.println("move disk "+disks+" from "+ fromPan +" to "+toPan);else{moveDisk(disks-1, fromPan, toPan, midPan);System.out.println("move disk "+disks+" from "+ fromPan +" to "+toPan);moveDisk(disks-1, midPan, fromPan,toPan);}}}

输出结果

<pre name="code" class="plain">please input disks num : 4move disk 1 from A to Cmove disk 2 from A to Bmove disk 1 from C to Bmove disk 3 from A to Cmove disk 1 from B to Amove disk 2 from B to Cmove disk 1 from A to Cmove disk 4 from A to Bmove disk 1 from C to Bmove disk 2 from C to Amove disk 1 from B to Amove disk 3 from C to Bmove disk 1 from A to Cmove disk 2 from A to Bmove disk 1 from C to B