资 源 简 介
设计一个车厢调度的程序，输出所有可能的序列 假设停在铁路调度站入口处的车厢序列的编号依次为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
