数据结构算法经典 -单链表(国外英文资料).docVIP

数据结构算法经典 -单链表(国外英文资料) / * 单链表的各种操作 * / # define zero 0 typedef char elemtype 字符型数据; / * * / typedef struct lnode { elemtype data; struct lnode * next; }; setnull (struct lnode * * p); int length (struct lnode * * p); elemtype get (struct lnode * * p, int i); void insert (struct lnode * * p, elemtype x, int i); int delete (struct lnode * * p, int i); void display (struct lnode * * p); main () { struct lnode * head, * q; / * 定义静态变量 * / int select, x1, x2, x3, x4. int i, n; int m, g; char d, y; head = setnull ( head); / * 建议链表并设置为空表 * / printf (请输入数据长度:); scanf() (% d, n). for (i = 1; i n; i + +). { printf (将数据插入到单链表中:); scanf() (% d, y); insert ( head, y, i);} / * 插入数据到链表 * / display head); / * 显示链表所有数据 * / printf (select 1 求长度 length () \ n); printf (select 2 取结点 get () \ n); printf (select 3 求值查找 locate () \ n); printf (select 4 删除结点 delete () \ n); printf (input your select:); scanf() (% d, ); switch (select) { case 1: { x1 = length ( head); printf (输出单链表的长度% d, x1); display head); ; break; case 2: { printf (请输入要取得结点:); scanf() (% d m); x2 = get ( head, m); printf (x2). display head); ; break; case 3: { printf (请输入要查找的数据:); scanf() (% d e); x3 = locate ( head, e). printf (x3). display head); ; break; case 4: { printf (请输入要删除的结点:); scanf() (% d, g). x4 = delete ( head, g). printf (x4). display head); ; break; } } } setnull (struct lnode * * p) { * p = null; } int length (struct lnode * * p) { int n = 0; struct lnode * q = * p; while (q! = = null) { n + +; q = q - next; } return (s); } elemtype get (struct lnode * * p, int i) { int j = 1; struct lnode * q = * p; while (j i q! = = null) { q = q - next; j + +; } if (q! = = null) return (q data); else printf (位置参数不正确! \ n ); } int locate (struct lnode * * p, elemtype x) { int n = 0; struct lnode * q = * p; while (q! = 0 q - data. = x) { q = q - next; n + +; } if (q = = null) return (- 1); else return (n + 1); } void insert (struct lnode * * p, elemtype x, int i) { int j = 1; struct lnode * s * q; s