c语言数据结构相关知识（C language data structure knowledge）.docVIP

c语言数据结构相关知识（C language data structure knowledge） 1 # includes stdlib.h # includes stdio.h # includes malloc.h struct linerlist / / 定义线性表结构 { / / 强化理解这里 * list号的含义, 保证l - list [] 不报错: 表达式必须包含指向对象的指针类型 / / 以及 (l - list = (int *) malloc (ms * sizeof (int))) = = null) 正常分配 int * list; / / 存线性表元素 int size; / / 存线性表长度 int maxsize; / / 存list数组元素个数 }; typedef struct linerlist list; void initlist (list * l, int m) {/ / 初始化线性表 if ((1 - list = (int *) malloc (ms * sizeof (int))) = = null) { printf (内存申请失败! \ n); exit (1); } l - size = 0; l - maxsize = ms. } insertlist (list int * l, int item, int rc) {/ / 将item插入线性表l的rc位置 / / item为记录值, rc为插入位置 int i; if (l - size = = l - maxsize) / / 线性表已满 return - 1; if (rc) 0) / / 插入位置为0到l - size rc = 0; if (cr l size) for (i = l - size - 1; i = rc; -) / / l [i + 1] = l [i]. l - list [i + 1] = l - list []; / / 线性表元素后移 l - list [rc] = item; l - size + +; return 0; } void outputlist (list * l) {/ / 输出线性表元素 int i; for (i = 0; i l size; i + +) printf (% d, l - list []); printf (\ n); } findlist (list int * l, int item) {/ / 寻找线性表元素, 返回≥0为元素位置, 1为没找到 int i; for (i = 0; i l size; i + +) { if (item = = l - list []) / / 找到相同元素, 返回位置 return i; } return - 1; } deletelist1 (list int * l, int item) / / 找到相同元素进行删除 {/ / 删除指定元素值的线性表记录, 返回≥0为删除成功 int i, n; for (i = 0; i l size; i + +) if (item = = l - list []) break; if (i l size) { for (n = i; n l size - 1; n + +) l - list [n] = l - list [n + 1]. l - size - -; return i; } return - 1; } deletelist2 (list int * l, int rc) Delete the specified {// record RC position elements Int i; If (rc0||rc=L-size) Return -1; For (i=rc; iL-size-1; i++) L-list[i]=L-list[i+1]; L-size--; Return 0; } Void (main) { LIST LL; Int i, r; //printf (LIST addr=%p\tsize=%d\tMaxSize=%d\n, LL.list, LL.size, LL.MAXSIZE); InitLIST (LL, 10); Printf (LIST addr=%p\tsize=%d\tMaxSize=%d\n, LL.list, LL.size, LL.MAXSIZE); OutputLIST (LL); While (1) { Printf (please input element values, 0 input end insert:);