HanoiFolder
于 2015-02-05 发布
文件大小:3KB
0 225
下载积分: 1
下载次数: 1
代码说明：
Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
