文件名称:3_hanoi
-
所属分类:
- 标签属性:
- 上传时间:2013-08-27
-
文件大小:1.42kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
汉诺塔是根据一个传说形成的一个问题:
有三根杆子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
3_hanoi/hanoi01.cpp
3_hanoi/useStack.cpp
3_hanoi
3_hanoi/hanoi01.cpp
3_hanoi/useStack.cpp
3_hanoi
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.