数据结构线性表（Data structure linear table）.docVIP

数据结构线性表（Data structure linear table） 1.线性表 # includes stdio.h # includes stdlib.h # define maxsize 100 typedef struct node { int date [maxsize]; int length; } seqlist, * pseqlist; pseqlist _ seqlist init () { pseqlist pl; pl = (pseqlist) malloc (sizeof (seqlist)); if (pl) pl - length = 0; return (pl). } int length _ seqlist (seqlist l) { return (l.length); } int location _ seqlist (seqlist l, int x) { int i = 0; if (i l.length l.data []. = x) the + +; if (i = l.length) return 0; else return (i + 1). } int insert _ seqlist (pseqlist pl, int i, int x) { int j; if (! pl) { printf (表不存在); return (- 2). } if (pl - length = maxsize) { printf (表溢出); return (- 1). } if ( 1 | | pl - length + 1) { printf (插入位置不合理); return (0); } for (j = pl - length - 1; j = 1; j -) pl - date [j + 1] = [j] pl - date. pl - date [- 1] = x; pl - length + +; return (1); } int delete _ seqlist (pseqlist pl, int i) { int j; if (! pl) { printf (表不存在); return (0); } if ( 1 | | pl - length) { printf (删除位置不合理); return (0); } for (j = i; j - pl - length; j + +) { pl - date (j - 1] = [j] pl - date. } pl - length - -; return (1); } void main () { int i; pseqlist pl; seqlist l; pl = l; l.length = 10; printf (请输入: \ n); for (i = 0; i l.length; i + +) scanf (% d, l.data []); delete _ seqlist (pl, 5); insert _ seqlist (pl, 6.7). for (i = 0; i l.length; i + +) printf (% d, l.data []); } 2.单链表 # includes stdio.h # includes stdlib.h typedef struct node { int date; struct node * next; } lnode, * linklist; linklist created _ linklist () { linklist h; h = (linklist) malloc (sizeof (lnode)); if (h) h - next = null; return h; } void destory _ linklist (linklist * h) { linklist p, q; p = * h; if (p) { q = p; p = p - next; free (q). } * h = null; } int length _ linklist (linklist h) { linklist p; int count = - 1; p = h; while (p) { count + +; p = p - next; } return count; } linklist locate _ linklist (linklist h, int i) { linklist p = h; int j = 0; while (p j i) { p = p - next; j