递归 汉诺塔问题 Java数据结构与算法

/**
*
* @author sunnyykn
*/
class TowersApp
{
static int nDisks = 3;
public static void main(String[] args)
{
doTowers(nDisks,'A','B','C');
}
public static void doTowers(int topN,char from,char inter,char to )
{
if(topN == 1)
System.out.println("Disk 1 from " + from + " to " + to);
else
{
doTowers(topN - 1,from,to,inter);
System.out.println("Disk " + topN + " from " + from + " to " + to);
doTowers(topN - 1,inter,from,to);
}
}
}