Introduction - If you have any usage issues, please Google them yourself
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.