问题描述

假设停在铁路调度站入口处的车厢序列的编号依次为1，2，3..n。设计一个程序，求出所有可能由此输出的的长度为n的车厢序列。

基本要求

在栈的顺序存储结构SqStack之上实现栈的五种基本要求，即实现栈类型。除了栈初始化操作之外，都要按函数实现。Push（s,x）是一个布尔函数，当且仅当栈s上溢出时返回“假“值；再说明一个ElemType型的常量StackEmptyMark，操作pop（s）和top（s）遇到栈s为空的情况时返回值StackEmptyMark。程序对栈的任何存取必须借助于基本操作要求。-Descr iption of the problem assume that stopped at the railway station at the entrance to the train scheduling sequence number followed by 1,2,3 .. n. Design a procedure to derive all the possible length of the resulting output of the compartment for the n sequences. The basic requirements of the order of storage in the stack structure to achieve stack SqStack above the five basic requirements, namely, the realization of the type stack. In addition to the initialization of the stack, the function must be in accordance. Push (s, x) is a Boolean function, if and only if s on stack overflow return　false　value　ElemType describe a type of constant StackEmptyMark, operation pop (s) and top (s) encountered as the stack s empty when the return value StackEmptyMark. Procedures on the stack must be through the use of any access to the basic operating requirements.