Location:
Search - chexiang
Search list
Description: 输出入口处车厢编号依次为1,2,3,...n的所有可能输出的长度.堆栈的数据类型实现
数据结构题集c语言版(严蔚敏版)中2.3的可行程序
Platform: |
Size: 18781 |
Author: 周君定 |
Hits:
Description: 输出入口处车厢编号依次为1,2,3,...n的所有可能输出的长度.堆栈的数据类型实现
数据结构题集c语言版(严蔚敏版)中2.3的可行程序-Output at the entrance to compartment number followed by 1,2,3, ... n all the possible length of the output. Stack data structure data types realize title set c language edition (YAN Wei-min version) in 2.3 viable procedure
Platform: |
Size: 186368 |
Author: 周君定 |
Hits:
Description: 火车车厢重排问题一列货运列车共有 n 节车厢，每节车厢将停放在不同的车站。假定 n 个车站的编号分别为 1 ~ n ，即货运列车按照第 n 站至第 1 站的次序经过这些车站。
Platform: |
Size: 671744 |
Author: swekey |
Hits:
Description: 利用队列结构实现车厢重排问题。车厢重排问题如下：
一列货车共有n节车厢，每个车厢都有自己的编号，编号范围从1~n。给定任意次序的车厢，通过转轨站将车厢编号按顺序重新排成1~n。转轨站共有k个缓冲轨，缓冲轨位于入轨和出轨之间。开始时，车厢从入轨进入缓冲轨，经过缓冲轨的重排后，按1~n的顺序进入出轨。缓冲轨按照先进先出方式，编写一个算法，将任意次序的车厢进行重排，输出每个缓冲轨中的车厢编号。
-Using queue structures to achieve car Rearrangement. Rearrangement inside the following: a freight train and rode a total of n cars, each car has its own number, number range from 1 ~ n. Compartment of any order given by the transition point will be re-arranged car number in sequence 1 ~ n. Transition point total of k-rail buffer, the buffer between the rail in the orbit and the derailment. Beginning of orbit into the buffer from the rail car after rail rearrangement buffer, press 1 ~ n the order into the derailment. Rail in accordance with the FIFO buffer mode, write an algorithm to order the car for any rearrangement, the output of each track in the buffer compartment number.
Platform: |
Size: 896000 |
Author: 莫凡 |
Hits:
Description: 系统应具备的功能：
（1）求出由一个编号依次为1，2，……，n的车厢序列可能产生的所有出栈系列；
（2）求出有多少种出栈的可能性；
（3）对于每个输出序列演示出所有操作序列的变化过程。
-System should have the function: (1) obtained by a number followed by 1,2, ... ..., n the car all the possible sequences of stack series (2) Find out how many species of the possibility of the stack ( 3) For each output sequence shows the sequence of the change process all operations.
Platform: |
Size: 1024 |
Author: 刘洋 |
Hits: