无头非循环单链表的常见操作.docVIP

无头非循环单链表的增删查 //slist.h #pragma once typedef int elem_t; struct node_t { elem_t data; struct node_t *next; }; //ADT: 抽象数据类型（强调两点：数据抽象和数据封装） //数据抽象：关注的是所要完成的功能，以及对外部如何定义接口 //数据封装：将数据或对象的外部特征和具体函数的实现分离，隐藏了函数的实现细节 //链表类 struct slist_t { struct node_t *head; //指向首元节点的指针 struct node_t *(*add)(struct slist_t *, elem_t); struct node_t *(*add_tail)(struct slist_t *, elem_t); struct node_t *(*for_each)(struct slist_t *, void (*)(struct node_t *)); struct node_t *(*search)(struct slist_t *, struct node_t *); struct node_t *(*search_last)(struct slist_t *); void (*del)(struct slist_t *, elem_t); int (*is_empty)(struct slist_t *); void (*destroy)(struct slist_t *); //析构函数 }; //初始化链表 void slist_init(struct slist_t *); //构造函数 //slist.c #include stdio.h #include stdlib.h #include slist.h static struct node_t *list_add(struct slist_t *slist, elem_t data) { struct node_t *node = (struct node_t *)malloc(sizeof(struct node_t)); if (!node) { fprintf(stderr, no enough mem!\n); return NULL; } //初始化节点 node-data = data; node-next = NULL; if (!slist-head) { //链表为空，head指向新插入的第一个节点 slist-head = node; } else { node-next = slist-head; slist-head = node; } return node; } static struct node_t *list_add_tail(struct slist_t *slist, elem_t data) { struct node_t *node = (struct node_t *)malloc(sizeof(struct node_t)); if (!node) { fprintf(stderr, no enough mem!\n); return NULL; } //初始化节点 node-data = data; node-next = NULL; struct node_t *cur = slist-head; if (!slist-head) { //链表为空，head指向新插入的第一个节点 slist-head = node; } else { for (; cur-next; cur = cur-next) {} cur-next = node; } return node; } static struct node_t *list_for_each(struct slist_t *slist, void (*todo)(struct node_t *)) { if (slist-is_empty(slist)) { //链表为空 return NULL; } struct node_t *cur = slist-head; for (; cur; cur = cur-next) { todo(cur); } printf(\n); return slist-head; } static struct node_t *search(struct slist_t *slist, struct node_t *node) { if (slist-is_