C语言
文章平均质量分 63
重画一个信仰
这个作者很懒,什么都没留下…
展开
-
按照严版伪代码写线性表的顺序实现
# include # include # include # define INIT_LIST_SIZE 10# define LISTINCREMENT 5typedef struct Node{ int data; char ch;}* PNODE, NODE;typedef struct List{ PNODE elem; int length; int原创 2014-04-30 13:47:14 · 618 阅读 · 0 评论 -
全功能单向链表
/*包括建立链表*/原创 2014-04-21 13:51:31 · 445 阅读 · 0 评论 -
循环(顺序或静态)队列对下标控制讨论
循环(顺序)队列对下标控制讨论并对严版数据结构一伪代码存疑原创 2014-04-26 14:02:37 · 732 阅读 · 0 评论 -
用结构体变量实现对动态数组的管理和操作
程序原理如下图:原创 2014-04-23 17:14:06 · 651 阅读 · 0 评论 -
循环(顺序)队列存储实现
顺序队列存储实现及原理原创 2014-04-26 08:48:53 · 813 阅读 · 0 评论 -
线性表写一元二次方程组
# include # include # include # define MAXLEN 40typedef struct Node{ int exp; float coe;}* PNODE, NODE;typedef struct { PNODE term;}* PLIST, LIST;void init (PLIST pL){ pL->term = (原创 2014-05-28 17:36:43 · 521 阅读 · 0 评论 -
链表程序改良
# include # include struct Node{ int data; struct Node * pNext;};struct Node * create_list(){ int len; struct Node * pHead = (struct Node *)malloc(sizeof(struct Node)); struct Node * p =原创 2014-04-16 20:10:51 · 616 阅读 · 1 评论 -
自己写的第一个链表程序
# include # include struct Node{ int data; struct Node * next;}; struct Node * create_list(){ int len; printf("请输入节点个数:"); scanf("%d", &len); struct Node * pHead =原创 2014-04-16 09:49:26 · 585 阅读 · 0 评论 -
栈实现括号匹配
# include # include # include # define INIT_STACK_SIZE 10# define STACKINCREMENT 5typedef struct{ char * base; char * top; int stacksize;}* PSTACK, STACK;void Init (PSTACK pS){ pS->bas原创 2014-05-08 20:36:08 · 431 阅读 · 0 评论 -
栈实现行编辑器
睡觉前总算完成了!!# include # include # include # define STACK_INIT_SIZE 20# define STACKINCREMENT 10typedef struct Stack{ char * base; char * top; int stacksize;}* PSTACK, STACK;void Init原创 2014-05-08 23:01:17 · 527 阅读 · 0 评论 -
顺序栈存储实现
# include # include typedef struct Node{ int data; char ch;}* PNODE, NODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}* PSTACK, STACK;void init(PSTACK pS, int len){ pS->pBottom =原创 2014-04-25 20:36:55 · 517 阅读 · 0 评论 -
表达式求值之求后缀式(亦即逆波兰式)
# include # include # include # define INIT_STACK_SIZE 10typedef struct{ int * top; int * base; int stacksize;}* PSTACK, STACK;void init (PSTACK pS){ pS->base = (int *)malloc(sizeof(int原创 2014-05-17 15:33:46 · 575 阅读 · 0 评论 -
链式队列存储实现及操作
# include # include # include typedef struct Node{ int data; struct Node * pNext;}* PNODE, NODE;typedef struct Queue{ PNODE pFront; PNODE pRare;}* PQUEUE, QUEUE;//初始化void init(PQUEUE原创 2014-04-25 08:54:09 · 491 阅读 · 0 评论 -
链式栈存储实现及操作
/*栈的构造与操作 初始化 压栈 出栈 遍历 清空*/# include # include # include typedef struct Node{ int data; struct Node * pNext;}* PNODE, NODE;typedef struct STACK{ PNODE pTop; PNODE pBottom;}原创 2014-04-24 19:52:19 · 518 阅读 · 0 评论 -
模式匹配之首位匹配
# include # include # include # define MAXSTRLEN 255typedef unsigned char Sstring [MAXSTRLEN + 1];int index (Sstring S, Sstring T) //这个写法虽然效率也不怎么高,但是写法真是有点别致。我是参考自严蔚敏视频配套讲义写的 //主要结构if原创 2014-05-18 17:10:40 · 519 阅读 · 0 评论 -
求二叉树深度
# include # include typedef char ElemType;typedef struct BiTnode{ ElemType data; struct BiTnode * lchild, * rchild;}BiTNode, * BiTree;int depth (BiTree &T) //求二叉树深度{ int depthval = 0; in原创 2014-06-03 11:19:25 · 649 阅读 · 0 评论