数据结构中比较难搞的算法之一------解决多列火车车厢的重排问题-Data structure, one of the more Nangao------ algorithm to solve multi-train cars Rearrangement Problem

本程序演示的是一个火车车厢重排事件。从本程序中可以学习如何用栈来解决复杂的排列问题。-This is a demo program trains rearrangement of events. From this program can learn how to use the stack to solve complicated arrangement.