文件名称:02-23-65
介绍说明--下载内容均来自于网络,请自行研究使用
通过输入车厢系列的编号n,求出所有可能由此输出的长度为n的车厢系列,用入栈出栈的方法,实现车厢调度,并演示每一种出栈序列的过程。任务:假设停在铁路调度站入口处的车厢系列的编号依次为1,2,3,…n。设计一个程序,求出所有可能由此输出的长度为n 的车厢系列。-Series by entering the number of compartments n, the resulting output to derive all possible n the length of the train line, using the stack method入栈to achieve train scheduling, and presentation of each sequence of the stack process. Tasks: the assumption that stopped at the railway station at the entrance to the train scheduling series of numbers followed by 1,2,3, ... n. Design a procedure to derive all the possible length of the resulting output for n series of compartments.
相关搜索: 车厢调度
(系统自动生成,下载前可以参看下载内容)
下载文件列表
0223
....\02-23-65.doc
....\车厢.cpp
....\02-23-65.doc
....\车厢.cpp