Welcome![Sign In][Sign Up]
Location:
Search - huoCheChongPai

Search list

[Other resourcehuoCheChongPai

Description: 使用堆栈完成火车车厢重排的算法,是一个小的算法,主要在于学习堆栈的应用。-use stack train compartments complete rearrangement of the algorithm, is a small algorithm, mainly studying the application stack.
Platform: | Size: 2110 | Author: 刘刚 | Hits:

[Data structshuoCheChongPai

Description: 使用堆栈完成火车车厢重排的算法,是一个小的算法,主要在于学习堆栈的应用。-use stack train compartments complete rearrangement of the algorithm, is a small algorithm, mainly studying the application stack.
Platform: | Size: 2048 | Author: 刘刚 | Hits:

[Data structshuochechongpai

Description: 一列火车要将N节车厢分别送往N个车站,车站按1-N的次序编号,火车按照N,N-1,....1的编号次序经过车站,假设车厢的编号就是其目的地车站的编号。 给定一个任意的车厢排列次序,重新排列车厢,使其按照从1到N的次序排列,规定重排时只能从入轨到缓冲铁轨,或者从缓冲铁轨出轨。 限制条件: 有一条入轨,一条出轨,K条缓冲铁轨(1≤K≤N-1)-A train carriages were sent to N N stations, railway stations, in the order of number 1-N, the train in accordance with N, N-1, .... number sequence 1 through the station, it is assumed that the number of the car to its destination number of the station. Given an arbitrary Priorities car, rearranges the car, it arranged in order 1 to N, predetermined rearrangement only orbit to buffer rails, or derailed the track buffer. Restrictions: There is an orbit, a derailment, K buffer strip rail (1≤K≤N-1)
Platform: | Size: 1024 | Author: aria | Hits:

CodeBus www.codebus.net