2016年12月
7.队列的链表实现
摘要： fatal.h queueli.h queueli.c testqueueli.c c include include "queueli.h" int main() { Queue Q; int i; Q = CreateQueue(); for (i = 0; i 阅读全文
posted @ 2016-12-23 04:10 typewriter 阅读(252) 评论(0) 推荐(0) 编辑
6.队列的数组实现
摘要： fatal.h queuear.h queuear.c testqueuear.c c include include "queuear.h" int main( ) { Queue Q; int i; Q = CreateQueue( 12 ); for( i = 0; i 阅读全文
posted @ 2016-12-23 03:54 typewriter 阅读(218) 评论(0) 推荐(0) 编辑
5.栈的链表实现
摘要： fatal.h stackli.h stackli.c teststkl.c c include include "stackli.h" int main() { Stack S; int i; S = CreateStack(); for (i = 0; i 阅读全文
posted @ 2016-12-22 15:41 typewriter 阅读(209) 评论(0) 推荐(0) 编辑
4.栈的数组实现
摘要： fatal.h stackar.h stackar.c teststka.c c include include "stackar.h" int main() { Stack S; int i; S = CreateStack(12); for (i = 0; i 阅读全文
posted @ 2016-12-22 15:27 typewriter 阅读(224) 评论(0) 推荐(0) 编辑
3.线性表-cursor
摘要： fatal.h cursor.h cursor.c c include "cursor.h" include include "fatal.h" / Place in the interface file / struct Node { ElementType Element; Position N 阅读全文
posted @ 2016-12-22 03:39 typewriter 阅读(176) 评论(0) 推荐(0) 编辑
2016年11月
2.线性表-Linked list
摘要： fatal.h linkedlist.h linkedlist.c testlinkedlist.c c include include "linkedlist.h" void PrintList(const List L) { Position P = Header(L); if (IsEmpty 阅读全文
posted @ 2016-11-09 17:27 typewriter 阅读(366) 评论(0) 推荐(0) 编辑
1.线性表-Array
摘要： fatal.h array.h array.c testarray.c c include include "array.h" void PrintList(const List L) { Position P = Header(L); if (IsEmpty(L)) printf("Empty l 阅读全文
posted @ 2016-11-09 03:25 typewriter 阅读(266) 评论(0) 推荐(0) 编辑
2016年10月
hello world!
摘要： ```c #include int main( ) { printf("Hello, world!\n"); return 0; } ``` 阅读全文
posted @ 2016-10-30 03:08 typewriter 阅读(190) 评论(0) 推荐(0) 编辑