VCL 到 FireMonkey

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

工作

TrainReset:there are many trains need to drive out of the station .In terms of their numbers from small to large.There are only three railways used to place the trains ,and also need the same order.-TrainReset : there are many trains need to drive out of the sta tion. In terms of their numbers from small to deviation ge.There are only three railways used to place t he trains, and also need the same order.

实现的功能是把数据库中的记录显示到列表视图中，可以进行记录添加、删除、修改、查询等操作-the functions of the database records to the list view and can be recorded to add, delete, modify, search operation

求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods

用delphi开发的一个数据表-with the development of a data table

数据结构答案2，经多次修改而成，比答案册的还要简单清楚。-answer two data structure, several revisions, the book also answers simple and clear.

用链表求300的阶乘,并且返回链表节点的个数.-used for the factorial 300, and returned to the linked list node number.

ACM模拟试题 饮食问题 附件中有详细的题目要求和运行通过的源代码-ACM mock examination papers eating problems are detailed in the annex to the subject requirements and run through the source code

ado-xmlcaozuo