文件名称:hannuotawenti
介绍说明－－下载内容均来自于网络，请自行研究使用
如果将n个盘子（由小到大）从a通过b，搬到c，搬运过程中不能出现小盘子在大盘子下面的情况。这个一个递归问题。只要将n-1个盘子从a通过c（没有中间点肯定不行）搬到b，再将第n个盘子从a搬到c，最后将n-1个盘子从b通过a搬到c。用C++解决。-N If a plate (small to large) a through b, moved to c, the removal process can not appear in a small dish platter the following scenario. This a recursive problem. As long as the n-1 a plate a (certainly not without an intermediate point) move b by c, then the n-th plate a move to c, and finally the n-1 plate b through a move c. Solve with C++.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
汉诺塔问题中的栈状态及递归执行层次.cpp
汉诺塔问题及其解决.c
汉诺塔问题.cpp