代码中用编号依次为1，2，3，……，n表示停在铁路调度站入口处的车厢序列。用一个栈形象地表示为火车的调度站。利用栈先进后出的性质，结合递归和回溯算法，实现编号1…n的车厢的所有可能的序列和每种序列的出入栈变化过程。-Followed by number 1,2,3, ......, n represents the sequence in the car parked at the entrance to the railway station scheduling. With a stack vividly expressed as a train dispatcher station. After the stack using advanced nature, combined with recursion and backtracking algorithms to achieve number one ... all the possible sequences and each sequence of the change process and out the stack of n compartments.