文件名称:3_hanoi
介绍说明－－下载内容均来自于网络，请自行研究使用
汉诺塔是根据一个传说形成的一个问题：
有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆：
每次只能移动一个圆盘；
大盘不能叠在小盘上面。-Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc size in order from the bottom to smaller. Requirements according to the following rules will move all disks C Rod: You can only move one disc market can not be stacked in small cap top.
有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆：
每次只能移动一个圆盘；
大盘不能叠在小盘上面。-Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc size in order from the bottom to smaller. Requirements according to the following rules will move all disks C Rod: You can only move one disc market can not be stacked in small cap top.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
3_hanoi\hanoi-stack.cpp
.......\hanoi01.cpp
.......\useStack.cpp
3_hanoi