文件名称:车厢调度问题123
介绍说明--下载内容来自于网络,使用问题请自行百度
设计一个车厢调度的程序,输出所有可能的序列 假设停在铁路调度站入口处的车厢序列的编号依次为1,2,3,n , 设计一个程序,求出所有可能的长度为n 的车厢序列。 实现栈的顺序存储结构SqStack之上实现栈的基本操作,即实现栈类型。程序对栈的基本操作必须借助于基本操作进行。 测试数据取 n=1,2,3, 程序输出的结果应该在屏幕上显示出来-Designs the procedure which a compartment dispatches, the output all
possible sequences supposition to stop in the railroad dispatch
station entrance compartment sequence serial number is in turn 1, 2,
3, n, Designs a procedure, extracts all possible lengths is the n
compartment sequence. Realizes above stack smooth memory structure
SqStack to realize the stack elementary operation eo, namely
realization stack type. The procedure must draw support to the stack
elementary operation eo in the elementary operation eo carries on. The
test data takes n=1,2,3, The procedure output result should show on the screen
possible sequences supposition to stop in the railroad dispatch
station entrance compartment sequence serial number is in turn 1, 2,
3, n, Designs a procedure, extracts all possible lengths is the n
compartment sequence. Realizes above stack smooth memory structure
SqStack to realize the stack elementary operation eo, namely
realization stack type. The procedure must draw support to the stack
elementary operation eo in the elementary operation eo carries on. The
test data takes n=1,2,3, The procedure output result should show on the screen
(系统自动生成,下载前可以参看下载内容)
下载文件列表
车厢调度.txt
www.dssz.com.txt
www.dssz.com.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.