Java使用递归法解决汉诺塔问题的代码示例

public class Hanoi { 
  
 public static void main(String[] args) { 
  int disk = 3; //盘子 
  move(disk, 'A', 'B', 'C'); 
 } 
  
 /* 
  * 根据题意，从上向下编号 => 1 ~ n 
  */ 
 /** 
  * 
  * @param topN 源塔顶的盘子编号 
  * @param from 从哪个塔移动 
  * @param inter 中介，过渡的塔 
  * @param to 目的塔 
  */ 
 private static void move(int topN, char from, char inter, char to) { 
  if (topN == 1) { 
   System.out.println("Disk 1 from " + from + " to " + to); 
  } else { 
   move(topN - 1, from, to, inter); 
   System.out.println("Disk " + topN + " from " + from + " to " + to); 
   move(topN - 1, inter, from, to); 
  } 
 } 
   
} 

Disk 1 from A to C 
Disk 2 from A to B 
Disk 1 from C to B 
Disk 3 from A to C 
Disk 1 from B to A 
Disk 2 from B to C 
Disk 1 from A to C