优化了命名

C11-数据结构/ds/line/list/arr/main.c

@@ -0,0 +1,81 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "sqlist.h"
+
+int main()
+{
+    sqlist *list  = NULL;
+    sqlist *list1 = NULL;
+
+    datatype arr[]  = {12, 23, 34, 45, 56};
+    datatype arr1[] = {89, 90, 78, 67, 56, 43};
+
+    int i, err;
+
+    list = sqlist_create();
+    // sqlist_create1(&list);
+    if (NULL == list)
+    {
+        fprintf(stderr, "sqlist_create() failed!\n");
+        exit(1);
+    }
+
+    list1 = sqlist_create();
+    if (NULL == list1)
+    {
+        fprintf(stderr, "sqlist_create() failed!\n");
+        exit(1);
+    }
+
+
+    for (i = 0; i < sizeof(arr) / sizeof(*arr); i++)
+    {
+        // !!! '=' 的优先级低于 '!='
+        if ((err = sqlist_insert(list, 0, &arr[i])) != 0)
+        {
+            if (-1 == err)
+                fprintf(stderr, "The arr is full.\n");
+            else if (-2 == err)
+                fprintf(stderr, "The pos you want to insert is wrong.\n");
+            else
+                fprintf(stderr, "Error!\n");
+            exit(1);
+        }
+    }
+
+    for (i = 0; i < sizeof(arr1) / sizeof(*arr1); i++)
+    {
+        // !!! '=' 的优先级低于 '!='
+        if ((err = sqlist_insert(list1, 0, &arr1[i])) != 0)
+        {
+            if (-1 == err)
+                fprintf(stderr, "The arr is full.\n");
+            else if (-2 == err)
+                fprintf(stderr, "The pos you want to insert is wrong.\n");
+            else
+                fprintf(stderr, "Error!\n");
+            exit(1);
+        }
+    }
+
+    // !!! 用打印行号排查段错误
+    // printf("%d\n", __LINE__);
+    sqlist_display(list);
+    sqlist_display(list1);
+
+    sqlist_union(list, list1);
+    sqlist_display(list);
+
+
+
+#if 0
+    sqlist_delete(list, 1);
+    sqlist_display(list);
+#endif
+
+    sqlist_destroy(list);
+    sqlist_destroy(list1);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/arr/makefile

@@ -0,0 +1,7 @@
+all:main
+
+main:main.o sqlist.o
+	$(CC) $^ -o $@
+
+clean:
+	rm *.o main -rf

C11-数据结构/ds/line/list/arr/sqlist.c

@@ -0,0 +1,131 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "sqlist.h"
+
+sqlist *sqlist_create()
+{
+    sqlist *me;
+
+    me = malloc(sizeof(*me));
+    if (NULL == me)
+        return NULL;
+
+    me->last = -1;
+
+    return me;
+}
+
+void sqlist_create1(sqlist **ptr)
+{
+    *ptr = malloc(sizeof(**ptr));
+    if (NULL == *ptr)
+        return;
+
+    (*ptr)->last = -1;
+    return;
+}
+
+int sqlist_insert(sqlist *me, int i, datatype *data)
+{
+    int j;
+
+    if (DATASIZE - 1 == me->last)
+        return -1;
+
+    if (i < 0 || i > me->last + 1)
+        return -2;
+
+    for (j = me->last; i <= j; j--)
+    {
+        me->data[j + 1] = me->data[j];
+    }
+
+    // TODO: 仅限常规数据结构
+    me->data[i] = *data;
+    me->last++;
+
+    return 0;
+}
+
+int sqlist_delete(sqlist *me, int i)
+{
+    int j;
+
+    if (i < 0 || i > me->last)
+        return -1;
+
+    for (j = i + 1; j <= me->last; j++)
+    {
+        me->data[j - 1] = me->data[j];
+    }
+
+    me->last--;
+
+    return 0;
+}
+
+int sqlist_find(sqlist *me, datatype *data)
+{
+    if (0 == sqlist_isempty(me))
+        return -1;
+
+
+    for (int i = 0; i < me->last; i++)
+    {
+        if (me->data[i] == *data)
+            return i;
+    }
+    return -2;
+}
+
+int sqlist_isempty(sqlist *me)
+{
+    if (-1 == me->last)
+        return 0;
+    return -1;
+}
+
+int sqlist_setempty(sqlist *me)
+{
+    me->last = -1;
+    return 0;
+}
+
+int sqlist_getnum(sqlist *me)
+{
+    return me->last + 1;
+}
+
+void sqlist_display(sqlist *me)
+{
+    if (-1 == me->last)
+        return;
+    for (int i = 0; i <= me->last; i++)
+    {
+        printf("%d ", me->data[i]);
+    }
+    printf("\n");
+}
+
+int sqlist_destroy(sqlist *me)
+{
+    free(me);
+    return 0;
+}
+
+int sqlist_union(sqlist *list1, sqlist *list2)
+{
+    // list1 -> 12 23 34 45 56
+    // list2 -> 78 89 56 23 10
+
+    int i = 0;
+
+    for (i = 0; i <= list2->last; i++)
+    {
+        if (sqlist_find(list1, &list2->data[i]) < 0)
+        {
+            sqlist_insert(list1, 0, &list2->data[i]);
+        }
+    }
+}

C11-数据结构/ds/line/list/arr/sqlist.h

@@ -0,0 +1,36 @@
+#ifndef SQLIST_H__
+#define SQLIST_H__
+
+#define DATASIZE 1024
+
+typedef int datatype;
+
+typedef struct node_st
+{
+    datatype data[DATASIZE];
+    int      last;
+} sqlist;
+
+sqlist *sqlist_create();
+void    sqlist_create1(sqlist **me);
+
+int sqlist_insert(sqlist *, int i, datatype *data);
+
+int sqlist_delete(sqlist *, int i);
+
+int sqlist_find(sqlist *, datatype *data);
+
+int sqlist_isempty(sqlist *);
+
+int sqlist_setempty(sqlist *);
+
+int sqlist_getnum(sqlist *);
+
+void sqlist_display(sqlist *);
+
+int sqlist_destroy(sqlist *);
+
+int sqlist_union(sqlist *, sqlist *);
+
+
+#endif

C11-数据结构/ds/line/list/linklist/double/kernel/list.h

@@ -0,0 +1,56 @@
+#ifndef LINUX_LIST_H__
+#define LINUX_LIST_H__
+
+struct list_head
+{
+    struct list_head *prev;
+    struct list_head *next;
+};
+
+#define LIST_HEAD_INIT(name) \
+    {                        \
+        &(name), &(name)     \
+    }
+
+#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
+
+static inline void __list_add(struct list_head *new,
+                              struct list_head *prev,
+                              struct list_head *next)
+{
+    next->prev = new;
+    new->next  = next;
+    new->prev  = prev;
+    prev->next = new;
+}
+
+static inline void list_add(struct list_head *new, struct list_head *head)
+{
+    __list_add(new, head, head->next);
+}
+
+#define __list_for_each(pos, head) \
+    for (pos = (head)->next; pos != (head); pos = pos->next)
+
+
+// 这个内核的链表仅包含两个指针，用来被数据包含
+// 希望由嵌入的指针找回到完整的结构体
+
+/**
+ * ptr->cur
+ * type->struct score_st
+ * member->node
+ *
+ */
+
+#define offsetof(TYPE, MEMBER) ((size_t) & ((TYPE *)0)->MEMBER)
+
+#define container_of(ptr, type, member)                    \
+    ({                                                     \
+        const typeof(((type *)0)->member) *__mptr = (ptr); \
+        (type *)((char *)__mptr - offsetof(type, member)); \
+    })
+
+#define list_entry(ptr, type, member) container_of(ptr, type, member)
+
+#endif

C11-数据结构/ds/line/list/linklist/double/kernel/main.c

@@ -0,0 +1,63 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "list.h"
+
+#define NAMESIZE 32
+
+struct score_st
+{
+    int              id;
+    char             name[NAMESIZE];
+    struct list_head node;
+    int              math;
+    int              chinese;
+};
+
+static void print_s(struct score_st *d)
+{
+    printf("%d %s %d %d \n", d->id, d->name, d->math, d->chinese);
+}
+
+int main()
+{
+    int               i;
+    struct score_st  *datap;
+    struct list_head *cur;
+
+    LIST_HEAD(head);
+
+    for (i = 0; i < 7; i++)
+    {
+        datap = malloc(sizeof(*datap));
+        if (NULL == datap)
+            exit(1);
+
+        datap->id = i;
+        snprintf(datap->name, NAMESIZE, "stu%d", i);
+        datap->math    = rand() % 100;
+        datap->chinese = rand() % 100;
+
+        list_add(&datap->node, &head);
+    }
+
+    __list_for_each(cur, &head)
+    {
+        datap = list_entry(cur, struct score_st, node);
+        print_s(datap);
+    }
+
+
+    __list_for_each(cur, &head)
+    {
+        datap = list_entry(cur, struct score_st, node);
+        if (5 == datap->id)
+            break;
+    }
+    if (cur == &head)
+        printf("Can not find!\n");
+    else
+        print_s(datap);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/double/kernel/makefile

@@ -0,0 +1,31 @@
+# 方便起见一般都会先定义编译器链接器
+CC = gcc 
+LD = gcc
+
+# 正则表达式表示目录下所有.c文件，相当于：SRCS = main.c a.c b.c
+SRCS = $(wildcard *.c)
+
+# OBJS表示SRCS中把列表中的.c全部替换为.o，相当于：OBJS = main.o a.o b.o
+OBJS = $(patsubst %c, %o, $(SRCS))
+
+# 可执行文件的名字
+TARGET = main
+
+# .PHONE伪目标，具体含义百度一下一大堆介绍
+.PHONY:all clean
+
+# 要生成的目标文件
+all: $(TARGET)
+
+# 第一行依赖关系：冒号后面为依赖的文件，相当于Hello: main.o a.o b.o
+# 第二行规则：$@表示目标文件，$^表示所有依赖文件，$<表示第一个依赖文件
+$(TARGET): $(OBJS)
+	$(LD) -o $@ $^
+
+# 上一句目标文件依赖一大堆.o文件，这句表示所有.o都由相应名字的.c文件自动生成
+%.o:%.c
+	$(CC) -c $^
+
+# make clean删除所有.o和目标文件
+clean:
+	rm -f $(OBJS) $(TARGET)

C11-数据结构/ds/line/list/linklist/double/lib1/Makefile

@@ -0,0 +1,31 @@
+# 方便起见一般都会先定义编译器链接器
+CC = gcc 
+LD = gcc
+
+# 正则表达式表示目录下所有.c文件，相当于：SRCS = main.c a.c b.c
+SRCS = $(wildcard *.c)
+
+# OBJS表示SRCS中把列表中的.c全部替换为.o，相当于：OBJS = main.o a.o b.o
+OBJS = $(patsubst %c, %o, $(SRCS))
+
+# 可执行文件的名字
+TARGET = main
+
+# .PHONE伪目标，具体含义百度一下一大堆介绍
+.PHONY:all clean
+
+# 要生成的目标文件
+all: $(TARGET)
+
+# 第一行依赖关系：冒号后面为依赖的文件，相当于Hello: main.o a.o b.o
+# 第二行规则：$@表示目标文件，$^表示所有依赖文件，$<表示第一个依赖文件
+$(TARGET): $(OBJS)
+	$(LD) -o $@ $^
+
+# 上一句目标文件依赖一大堆.o文件，这句表示所有.o都由相应名字的.c文件自动生成
+%.o:%.c
+	$(CC) -c $^
+
+# make clean删除所有.o和目标文件
+clean:
+	rm -f $(OBJS) $(TARGET)

C11-数据结构/ds/line/list/linklist/double/lib1/llist.c

@@ -0,0 +1,134 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+LLIST *llist_create(int initsize)
+{
+    LLIST *new;
+
+    new = malloc(sizeof(*new));   // !!! 不是sizeof(initsize),也不是new,是*new
+    if (NULL == new)
+        return NULL;
+
+    new->size      = initsize;
+    new->head.data = NULL;
+    new->head.prev = &new->head;
+    new->head.next = &new->head;
+
+    return new;
+}
+
+int llist_insert(LLIST *ptr, const void *data, int mode)
+{
+    struct llist_node_st *newnode;
+
+    newnode = malloc(sizeof(*newnode));
+    if (NULL == newnode)
+        return -1;
+
+    newnode->data = malloc(ptr->size);
+    if (newnode->data == NULL)
+        return -2;
+
+    memcpy(newnode->data, data, ptr->size);
+
+    if (LLIST_FORWARD == mode)
+    {
+        newnode->prev = &ptr->head;
+        newnode->next = ptr->head.next;
+    }
+    else if (LLIST_BACKWARD == mode)
+    {
+        newnode->prev = ptr->head.prev;
+        newnode->next = &ptr->head;
+    }
+    else   // error
+    {
+        return -3;
+    }
+
+    // !!! 妙啊
+    newnode->next->prev = newnode;
+    newnode->prev->next = newnode;
+
+    return 0;
+}
+
+static struct llist_node_st *find_(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+    {
+        if (0 == cmp(key, cur->data))
+            break;
+    }
+
+    return cur;   // 找不到的时候，返回的cur就是ptr，返回NULL
+}
+
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    return find_(ptr, key, cmp)->data;
+}
+
+int llist_delete(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    // !!!
+    node->prev->next = node->next;
+    node->next->prev = node->prev;
+    free(node->data);
+    free(node);
+
+    return 0;
+}
+
+int llist_fetch(LLIST *ptr, const void *key, llist_cmp *cmp, void *data)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    node->next->prev = node->prev;
+    node->prev->next = node->next;
+
+    if (data != NULL)
+        memcpy(data, node->data, ptr->size);
+
+    free(node->data);
+    free(node);
+
+    return 0;
+}
+
+void llist_travel(LLIST *ptr, llist_op *op)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+        op(cur->data);
+}
+
+void llist_destroy(LLIST *ptr)
+{
+    struct llist_node_st *cur, *next;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = next)
+    {
+        next = cur->next;
+        free(cur->data);
+        free(cur);
+    }
+
+    free(ptr);
+}

C11-数据结构/ds/line/list/linklist/double/lib1/llist.h

@@ -0,0 +1,37 @@
+#ifndef LLIST_H__
+#define LLIST_H__
+
+#define LLIST_FORWARD  1
+#define LLIST_BACKWARD 2
+
+struct llist_node_st
+{
+    void                 *data;
+    struct llist_node_st *prev;
+    struct llist_node_st *next;
+};
+
+typedef struct
+{
+    int                  size;
+    struct llist_node_st head;
+} LLIST;
+
+typedef void llist_op(const void *);
+typedef int  llist_cmp(const void *, const void *);
+
+LLIST *llist_create(int initsize);
+
+int llist_insert(LLIST *ptr, const void *data, int mode);
+
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *);
+
+int llist_delete(LLIST *, const void *key, llist_cmp *);
+
+int llist_fetch(LLIST *, const void *key, llist_cmp *, void *data);
+
+void llist_travel(LLIST *ptr, llist_op *op);
+
+void llist_destroy(LLIST *ptr);
+
+#endif

C11-数据结构/ds/line/list/linklist/double/lib1/main.c

@@ -0,0 +1,95 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+#define NAMESIZE 32
+
+struct score_st
+{
+    int  id;
+    char name[NAMESIZE];
+    int  math;
+    int  chinese;
+};
+
+void print_s(const void *record)
+{
+    const struct score_st *r = record;
+
+    printf("%d %s %d %d\n", r->id, r->name, r->math, r->chinese);
+}
+
+int id_cmp(const void *key, const void *record)
+{
+    const int             *k = key;
+    const struct score_st *r = record;
+
+    return (*k - r->id);
+}
+
+int name_cmp(const void *key, const void *record)
+{
+    const char            *k = key;
+    const struct score_st *r = record;
+
+    return strcmp(k, r->name);
+}
+
+
+int main()
+{
+    LLIST          *handler;
+    int             i, ret;
+    struct score_st tmp;
+
+    handler = llist_create(sizeof(struct score_st));
+    if (NULL == handler)
+        exit(1);
+
+    for (i = 0; i < 7; i++)
+    {
+        tmp.id = i;
+        snprintf(tmp.name, NAMESIZE, "std%d", i);
+        tmp.math    = rand() % 100;
+        tmp.chinese = rand() % 100;
+
+        ret = llist_insert(handler, &tmp, LLIST_FORWARD);
+        if (ret)
+            exit(1);
+    }
+
+    llist_travel(handler, print_s);
+
+    printf("\n\n");
+
+    // int id = 3;
+    char *del_name = "std6";
+
+    // ret = llist_delete(handler, &id, id_cmp);
+    ret = llist_delete(handler, del_name, name_cmp);
+    if (ret)
+        printf("llist_deleter failed!\n");
+
+    llist_travel(handler, print_s);
+
+
+
+#if 0
+    int              id = 3;
+    struct score_st *data;
+
+    data = llist_find(handler, &id, id_cmp);
+    if (NULL == data)
+        printf("Can not find!\n");
+    else
+        print_s(data);
+
+#endif
+
+
+    llist_destroy(handler);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/double/lib2/Makefile

@@ -0,0 +1,31 @@
+# 方便起见一般都会先定义编译器链接器
+CC = gcc 
+LD = gcc
+
+# 正则表达式表示目录下所有.c文件，相当于：SRCS = main.c a.c b.c
+SRCS = $(wildcard *.c)
+
+# OBJS表示SRCS中把列表中的.c全部替换为.o，相当于：OBJS = main.o a.o b.o
+OBJS = $(patsubst %c, %o, $(SRCS))
+
+# 可执行文件的名字
+TARGET = main
+
+# .PHONE伪目标，具体含义百度一下一大堆介绍
+.PHONY:all clean
+
+# 要生成的目标文件
+all: $(TARGET)
+
+# 第一行依赖关系：冒号后面为依赖的文件，相当于Hello: main.o a.o b.o
+# 第二行规则：$@表示目标文件，$^表示所有依赖文件，$<表示第一个依赖文件
+$(TARGET): $(OBJS)
+	$(LD) -o $@ $^
+
+# 上一句目标文件依赖一大堆.o文件，这句表示所有.o都由相应名字的.c文件自动生成
+%.o:%.c
+	$(CC) -c $^
+
+# make clean删除所有.o和目标文件
+clean:
+	rm -f $(OBJS) $(TARGET)

C11-数据结构/ds/line/list/linklist/double/lib2/llist.c

@@ -0,0 +1,130 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+LLIST *llist_create(int initsize)
+{
+    LLIST *new;
+
+    new = malloc(sizeof(*new));   // !!! 不是sizeof(initsize),也不是new,是*new
+    if (NULL == new)
+        return NULL;
+
+    new->size      = initsize;
+    new->head.prev = &new->head;
+    new->head.next = &new->head;
+
+    return new;
+}
+
+int llist_insert(LLIST *ptr, const void *data, int mode)
+{
+    struct llist_node_st *newnode;
+
+    newnode = malloc(sizeof(*newnode) + ptr->size);   // -4
+    if (NULL == newnode)
+        return -1;
+
+    memcpy(newnode->data, data, ptr->size);
+
+    if (LLIST_FORWARD == mode)
+    {
+        newnode->prev = &ptr->head;
+        newnode->next = ptr->head.next;
+    }
+    else if (LLIST_BACKWARD == mode)
+    {
+        newnode->prev = ptr->head.prev;
+        newnode->next = &ptr->head;
+    }
+    else   // error
+    {
+        return -3;
+    }
+
+    // !!! 妙啊
+    newnode->next->prev = newnode;
+    newnode->prev->next = newnode;
+
+    return 0;
+}
+
+static struct llist_node_st *find_(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+    {
+        if (0 == cmp(key, cur->data))
+            break;
+    }
+
+    return cur;   // 找不到的时候，返回的cur就是ptr，返回NULL
+}
+
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *node;
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return NULL;
+
+    return node->data;
+}
+
+int llist_delete(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    // !!!
+    node->prev->next = node->next;
+    node->next->prev = node->prev;
+    free(node);
+    return 0;
+}
+
+int llist_fetch(LLIST *ptr, const void *key, llist_cmp *cmp, void *data)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    node->next->prev = node->prev;
+    node->prev->next = node->next;
+
+    if (data != NULL)
+        memcpy(data, node->data, ptr->size);
+
+    free(node);
+
+    return 0;
+}
+
+void llist_travel(LLIST *ptr, llist_op *op)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+        op(cur->data);
+}
+
+void llist_destroy(LLIST *ptr)
+{
+    struct llist_node_st *cur, *next;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = next)
+    {
+        next = cur->next;
+        free(cur);
+    }
+
+    free(ptr);
+}

C11-数据结构/ds/line/list/linklist/double/lib2/llist.h

@@ -0,0 +1,39 @@
+#ifndef LLIST_H__
+#define LLIST_H__
+
+#define LLIST_FORWARD  1
+#define LLIST_BACKWARD 2
+
+// !!! 变长结构体
+struct llist_node_st
+{
+    struct llist_node_st *prev;
+    struct llist_node_st *next;
+    // data要放在最后
+    char data[1];   // 占位符，数据的起始。C99才只是[0]
+};
+
+typedef struct
+{
+    int                  size;
+    struct llist_node_st head;
+} LLIST;
+
+typedef void llist_op(const void *);
+typedef int  llist_cmp(const void *, const void *);
+
+LLIST *llist_create(int initsize);
+
+int llist_insert(LLIST *ptr, const void *data, int mode);
+
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *);
+
+int llist_delete(LLIST *, const void *key, llist_cmp *);
+
+int llist_fetch(LLIST *, const void *key, llist_cmp *, void *data);
+
+void llist_travel(LLIST *ptr, llist_op *op);
+
+void llist_destroy(LLIST *ptr);
+
+#endif

C11-数据结构/ds/line/list/linklist/double/lib2/main.c

@@ -0,0 +1,95 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+#define NAMESIZE 32
+
+struct score_st
+{
+    int  id;
+    char name[NAMESIZE];
+    int  math;
+    int  chinese;
+};
+
+void print_s(const void *record)
+{
+    const struct score_st *r = record;
+
+    printf("%d %s %d %d\n", r->id, r->name, r->math, r->chinese);
+}
+
+int id_cmp(const void *key, const void *record)
+{
+    const int             *k = key;
+    const struct score_st *r = record;
+
+    return (*k - r->id);
+}
+
+int name_cmp(const void *key, const void *record)
+{
+    const char            *k = key;
+    const struct score_st *r = record;
+
+    return strcmp(k, r->name);
+}
+
+
+int main()
+{
+    LLIST          *handler;
+    int             i, ret;
+    struct score_st tmp;
+
+    handler = llist_create(sizeof(struct score_st));
+    if (NULL == handler)
+        exit(1);
+
+    for (i = 0; i < 7; i++)
+    {
+        tmp.id = i;
+        snprintf(tmp.name, NAMESIZE, "std%d", i);
+        tmp.math    = rand() % 100;
+        tmp.chinese = rand() % 100;
+
+        ret = llist_insert(handler, &tmp, LLIST_FORWARD);
+        if (ret)
+            exit(1);
+    }
+
+    llist_travel(handler, print_s);
+
+    printf("\n\n");
+
+    // int id = 3;
+    char *del_name = "std6";
+
+    // ret = llist_delete(handler, &id, id_cmp);
+    ret = llist_delete(handler, del_name, name_cmp);
+    if (ret)
+        printf("llist_deleter failed!\n");
+
+    llist_travel(handler, print_s);
+
+
+
+#if 0
+    int              id = 3;
+    struct score_st *data;
+
+    data = llist_find(handler, &id, id_cmp);
+    if (NULL == data)
+        printf("Can not find!\n");
+    else
+        print_s(data);
+
+#endif
+
+
+    llist_destroy(handler);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/double/lib3/Makefile

@@ -0,0 +1,31 @@
+# 方便起见一般都会先定义编译器链接器
+CC = gcc 
+LD = gcc
+
+# 正则表达式表示目录下所有.c文件，相当于：SRCS = main.c a.c b.c
+SRCS = $(wildcard *.c)
+
+# OBJS表示SRCS中把列表中的.c全部替换为.o，相当于：OBJS = main.o a.o b.o
+OBJS = $(patsubst %c, %o, $(SRCS))
+
+# 可执行文件的名字
+TARGET = main
+
+# .PHONE伪目标，具体含义百度一下一大堆介绍
+.PHONY:all clean
+
+# 要生成的目标文件
+all: $(TARGET)
+
+# 第一行依赖关系：冒号后面为依赖的文件，相当于Hello: main.o a.o b.o
+# 第二行规则：$@表示目标文件，$^表示所有依赖文件，$<表示第一个依赖文件
+$(TARGET): $(OBJS)
+	$(LD) -o $@ $^
+
+# 上一句目标文件依赖一大堆.o文件，这句表示所有.o都由相应名字的.c文件自动生成
+%.o:%.c
+	$(CC) -c $^
+
+# make clean删除所有.o和目标文件
+clean:
+	rm -f $(OBJS) $(TARGET)

C11-数据结构/ds/line/list/linklist/double/lib3/llist.c

@@ -0,0 +1,142 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+int   llist_insert(LLIST *ptr, const void *data, int mode);
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *);
+int   llist_delete(LLIST *, const void *key, llist_cmp *);
+int   llist_fetch(LLIST *, const void *key, llist_cmp *, void *data);
+void  llist_travel(LLIST *ptr, llist_op *op);
+
+LLIST *llist_create(int initsize)
+{
+    LLIST *new;
+
+    new = malloc(sizeof(*new));   // !!! 不是sizeof(initsize),也不是new,是*new
+    if (NULL == new)
+        return NULL;
+
+    new->size      = initsize;
+    new->head.prev = &new->head;
+    new->head.next = &new->head;
+
+    new->insert = llist_insert;
+    new->delete = llist_delete;
+    new->find   = llist_find;
+    new->fetch  = llist_fetch;
+    new->travel = llist_travel;
+
+    return new;
+}
+
+int llist_insert(LLIST *ptr, const void *data, int mode)
+{
+    struct llist_node_st *newnode;
+
+    newnode = malloc(sizeof(*newnode) + ptr->size);   // -4
+    if (NULL == newnode)
+        return -1;
+
+    memcpy(newnode->data, data, ptr->size);
+
+    if (LLIST_FORWARD == mode)
+    {
+        newnode->prev = &ptr->head;
+        newnode->next = ptr->head.next;
+    }
+    else if (LLIST_BACKWARD == mode)
+    {
+        newnode->prev = ptr->head.prev;
+        newnode->next = &ptr->head;
+    }
+    else   // error
+    {
+        return -3;
+    }
+
+    // !!! 妙啊
+    newnode->next->prev = newnode;
+    newnode->prev->next = newnode;
+
+    return 0;
+}
+
+static struct llist_node_st *find_(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+    {
+        if (0 == cmp(key, cur->data))
+            break;
+    }
+
+    return cur;   // 找不到的时候，返回的cur就是ptr，返回NULL
+}
+
+void *llist_find(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *node;
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return NULL;
+
+    return node->data;
+}
+
+int llist_delete(LLIST *ptr, const void *key, llist_cmp *cmp)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    // !!!
+    node->prev->next = node->next;
+    node->next->prev = node->prev;
+    free(node);
+    return 0;
+}
+
+int llist_fetch(LLIST *ptr, const void *key, llist_cmp *cmp, void *data)
+{
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    node->next->prev = node->prev;
+    node->prev->next = node->next;
+
+    if (data != NULL)
+        memcpy(data, node->data, ptr->size);
+
+    free(node);
+
+    return 0;
+}
+
+void llist_travel(LLIST *ptr, llist_op *op)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+        op(cur->data);
+}
+
+void llist_destroy(LLIST *ptr)
+{
+    struct llist_node_st *cur, *next;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = next)
+    {
+        next = cur->next;
+        free(cur);
+    }
+
+    free(ptr);
+}

C11-数据结构/ds/line/list/linklist/double/lib3/llist.h

@@ -0,0 +1,38 @@
+#ifndef LLIST_H__
+#define LLIST_H__
+
+#define LLIST_FORWARD  1
+#define LLIST_BACKWARD 2
+
+typedef void llist_op(const void *);
+typedef int  llist_cmp(const void *, const void *);
+
+// !!! 变长结构体
+struct llist_node_st
+{
+    struct llist_node_st *prev;
+    struct llist_node_st *next;
+    // data要放在最后
+    char data[1];   // 占位符，数据的起始。C99才只是[0]
+};
+
+typedef struct llist_head
+{
+    int                  size;
+    struct llist_node_st head;
+
+    int (*insert)(struct llist_head *, const void *, int);
+    void *(*find)(struct llist_head *, const void *, llist_cmp *);
+    int (*delete)(struct llist_head *, const void *, llist_cmp *);
+    int (*fetch)(struct llist_head *, const void *, llist_cmp *, void *);
+    void (*travel)(struct llist_head *, llist_op *);
+
+} LLIST;
+
+
+
+LLIST *llist_create(int initsize);
+
+void llist_destroy(LLIST *ptr);
+
+#endif

C11-数据结构/ds/line/list/linklist/double/lib3/main.c

@@ -0,0 +1,97 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+#define NAMESIZE 32
+
+struct score_st
+{
+    int  id;
+    char name[NAMESIZE];
+    int  math;
+    int  chinese;
+};
+
+void print_s(const void *record)
+{
+    const struct score_st *r = record;
+
+    printf("%d %s %d %d\n", r->id, r->name, r->math, r->chinese);
+}
+
+int id_cmp(const void *key, const void *record)
+{
+    const int             *k = key;
+    const struct score_st *r = record;
+
+    return (*k - r->id);
+}
+
+int name_cmp(const void *key, const void *record)
+{
+    const char            *k = key;
+    const struct score_st *r = record;
+
+    return strcmp(k, r->name);
+}
+
+
+int main()
+{
+    LLIST          *handler;
+    int             i, ret;
+    struct score_st tmp;
+
+    handler = llist_create(sizeof(struct score_st));
+    if (NULL == handler)
+        exit(1);
+
+    for (i = 0; i < 7; i++)
+    {
+        tmp.id = i;
+        snprintf(tmp.name, NAMESIZE, "std%d", i);
+        tmp.math    = rand() % 100;
+        tmp.chinese = rand() % 100;
+
+        ret = handler->insert(handler, &tmp, LLIST_FORWARD);
+        if (ret)
+            exit(1);
+    }
+
+    handler->travel(handler, print_s);
+
+
+
+#if 0
+    printf("\n\n");
+
+    // int id = 3;
+    char *del_name = "std6";
+
+    // ret = llist_delete(handler, &id, id_cmp);
+    ret = llist_delete(handler, del_name, name_cmp);
+    if (ret)
+        printf("llist_deleter failed!\n");
+
+    llist_travel(handler, print_s);
+
+
+
+    int              id = 3;
+    struct score_st *data;
+
+    data = llist_find(handler, &id, id_cmp);
+    if (NULL == data)
+        printf("Can not find!\n");
+    else
+        print_s(data);
+
+#endif
+
+
+    llist_destroy(handler);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/double/lib4/Makefile

@@ -0,0 +1,31 @@
+# 方便起见一般都会先定义编译器链接器
+CC = gcc 
+LD = gcc
+
+# 正则表达式表示目录下所有.c文件，相当于：SRCS = main.c a.c b.c
+SRCS = $(wildcard *.c)
+
+# OBJS表示SRCS中把列表中的.c全部替换为.o，相当于：OBJS = main.o a.o b.o
+OBJS = $(patsubst %c, %o, $(SRCS))
+
+# 可执行文件的名字
+TARGET = main
+
+# .PHONE伪目标，具体含义百度一下一大堆介绍
+.PHONY:all clean
+
+# 要生成的目标文件
+all: $(TARGET)
+
+# 第一行依赖关系：冒号后面为依赖的文件，相当于Hello: main.o a.o b.o
+# 第二行规则：$@表示目标文件，$^表示所有依赖文件，$<表示第一个依赖文件
+$(TARGET): $(OBJS)
+	$(LD) -o $@ $^
+
+# 上一句目标文件依赖一大堆.o文件，这句表示所有.o都由相应名字的.c文件自动生成
+%.o:%.c
+	$(CC) -c $^
+
+# make clean删除所有.o和目标文件
+clean:
+	rm -f $(OBJS) $(TARGET)

C11-数据结构/ds/line/list/linklist/double/lib4/llist.c

@@ -0,0 +1,153 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+// !!! 变长结构体
+struct llist_node_st
+{
+    struct llist_node_st *prev;
+    struct llist_node_st *next;
+    // data要放在最后
+    char data[1];   // 占位符，数据的起始。C99才只是[0]
+};
+
+struct llist_head_st
+{
+    int                  size;
+    struct llist_node_st head;
+};
+
+LLIST *llist_create(int initsize)
+{
+    struct llist_head_st *new;
+
+    new = malloc(sizeof(*new));   // !!! 不是sizeof(initsize),也不是new,是*new
+    if (NULL == new)
+        return NULL;
+
+    new->size      = initsize;
+    new->head.prev = &new->head;
+    new->head.next = &new->head;
+
+    return new;
+}
+
+int llist_insert(LLIST *p, const void *data, int mode)
+{
+    struct llist_node_st *newnode;
+    struct llist_head_st *ptr = p;
+
+    newnode = malloc(sizeof(*newnode) + ptr->size);   // -4
+    if (NULL == newnode)
+        return -1;
+
+    memcpy(newnode->data, data, ptr->size);
+
+    if (LLIST_FORWARD == mode)
+    {
+        newnode->prev = &ptr->head;
+        newnode->next = ptr->head.next;
+    }
+    else if (LLIST_BACKWARD == mode)
+    {
+        newnode->prev = ptr->head.prev;
+        newnode->next = &ptr->head;
+    }
+    else   // error
+    {
+        return -3;
+    }
+
+    // !!! 妙啊
+    newnode->next->prev = newnode;
+    newnode->prev->next = newnode;
+
+    return 0;
+}
+
+static struct llist_node_st *find_(struct llist_head_st *ptr,
+                                   const void           *key,
+                                   llist_cmp            *cmp)
+{
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+    {
+        if (0 == cmp(key, cur->data))
+            break;
+    }
+
+    return cur;   // 找不到的时候，返回的cur就是ptr，返回NULL
+}
+
+void *llist_find(LLIST *p, const void *key, llist_cmp *cmp)
+{
+    struct llist_head_st *ptr = p;
+    struct llist_node_st *node;
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return NULL;
+
+    return node->data;
+}
+
+int llist_delete(LLIST *p, const void *key, llist_cmp *cmp)
+{
+    struct llist_head_st *ptr = p;
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    // !!!
+    node->prev->next = node->next;
+    node->next->prev = node->prev;
+    free(node);
+    return 0;
+}
+
+int llist_fetch(LLIST *p, const void *key, llist_cmp *cmp, void *data)
+{
+    struct llist_head_st *ptr = p;
+    struct llist_node_st *node;
+
+    node = find_(ptr, key, cmp);
+    if (node == &ptr->head)
+        return -1;
+
+    node->next->prev = node->prev;
+    node->prev->next = node->next;
+
+    if (data != NULL)
+        memcpy(data, node->data, ptr->size);
+
+    free(node);
+
+    return 0;
+}
+
+void llist_travel(LLIST *p, llist_op *op)
+{
+    struct llist_head_st *ptr = p;
+    struct llist_node_st *cur;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = cur->next)
+        op(cur->data);
+}
+
+void llist_destroy(LLIST *p)
+{
+    struct llist_head_st *ptr = p;
+    struct llist_node_st *cur, *next;
+
+    for (cur = ptr->head.next; cur != &ptr->head; cur = next)
+    {
+        next = cur->next;
+        free(cur);
+    }
+
+    free(ptr);
+}

C11-数据结构/ds/line/list/linklist/double/lib4/llist.h

@@ -0,0 +1,27 @@
+#ifndef LLIST_H__
+#define LLIST_H__
+
+#define LLIST_FORWARD  1
+#define LLIST_BACKWARD 2
+
+// !!! 实现了隐藏 LLIST 的实现方法
+typedef void LLIST;
+
+typedef void llist_op(const void *);
+typedef int  llist_cmp(const void *, const void *);
+
+LLIST *llist_create(int initsize);
+
+int llist_insert(LLIST *, const void *data, int mode);
+
+void *llist_find(LLIST *, const void *key, llist_cmp *);
+
+int llist_delete(LLIST *, const void *key, llist_cmp *);
+
+int llist_fetch(LLIST *, const void *key, llist_cmp *, void *data);
+
+void llist_travel(LLIST *, llist_op *);
+
+void llist_destroy(LLIST *);
+
+#endif

C11-数据结构/ds/line/list/linklist/double/lib4/main.c

@@ -0,0 +1,95 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "llist.h"
+
+#define NAMESIZE 32
+
+struct score_st
+{
+    int  id;
+    char name[NAMESIZE];
+    int  math;
+    int  chinese;
+};
+
+void print_s(const void *record)
+{
+    const struct score_st *r = record;
+
+    printf("%d %s %d %d\n", r->id, r->name, r->math, r->chinese);
+}
+
+int id_cmp(const void *key, const void *record)
+{
+    const int             *k = key;
+    const struct score_st *r = record;
+
+    return (*k - r->id);
+}
+
+int name_cmp(const void *key, const void *record)
+{
+    const char            *k = key;
+    const struct score_st *r = record;
+
+    return strcmp(k, r->name);
+}
+
+
+int main()
+{
+    LLIST          *handler;
+    int             i, ret;
+    struct score_st tmp;
+
+    handler = llist_create(sizeof(struct score_st));
+    if (NULL == handler)
+        exit(1);
+
+    for (i = 0; i < 7; i++)
+    {
+        tmp.id = i;
+        snprintf(tmp.name, NAMESIZE, "std%d", i);
+        tmp.math    = rand() % 100;
+        tmp.chinese = rand() % 100;
+
+        ret = llist_insert(handler, &tmp, LLIST_FORWARD);
+        if (ret)
+            exit(1);
+    }
+
+    llist_travel(handler, print_s);
+
+    printf("\n\n");
+
+    // int id = 3;
+    char *del_name = "std6";
+
+    // ret = llist_delete(handler, &id, id_cmp);
+    ret = llist_delete(handler, del_name, name_cmp);
+    if (ret)
+        printf("llist_deleter failed!\n");
+
+    llist_travel(handler, print_s);
+
+
+
+#if 0
+    int              id = 3;
+    struct score_st *data;
+
+    data = llist_find(handler, &id, id_cmp);
+    if (NULL == data)
+        printf("Can not find!\n");
+    else
+        print_s(data);
+
+#endif
+
+
+    llist_destroy(handler);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/simple/head/list.c

@@ -0,0 +1,156 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "list.h"
+
+list *list_create()
+{
+    list *me;
+    me = malloc(sizeof(*me));
+    if (NULL == me)
+        return NULL;
+
+    me->next = NULL;
+
+    return me;
+}
+
+// 从第一个有效节点作为第0个
+int list_insert_at(list *me, int i, datatype *data)
+{
+    int   k    = 0;
+    list *node = me, *newnode;
+
+    if (i < 0)
+        return -1;
+    // return -EINVAL;
+
+    while (k < i && node != NULL)
+    {
+        node = node->next;
+        k++;
+    }
+
+    if (NULL != node)
+    {
+        newnode = malloc(sizeof(*newnode));
+        if (NULL == newnode)
+            return -2;
+
+        newnode->data = *data;
+        newnode->next = NULL;
+
+        newnode->next = node->next;
+        node->next    = newnode;
+
+        return 0;
+    }
+    else
+        return -3;
+}
+
+// 有序插入
+int list_order_insert(list *me, datatype *data)
+{
+    list *p = me, *q;
+
+    while (p->next && p->next->data < *data)
+        p = p->next;
+
+    q = malloc(sizeof(*q));
+    if (NULL == q)
+        return -1;
+
+    q->data = *data;
+    q->next = p->next;
+    p->next = q;
+
+    return 0;
+}
+
+int list_delete_at(list *me, int i, datatype *data)
+{
+    int   k = 0;
+    list *p = me, *q;
+
+    *data = -1;
+
+    if (i < 0)
+        return -1;
+
+    while (k < i)
+    {
+        p = p->next;
+        k++;
+    }
+
+    if (p)
+    {
+        q       = p->next;
+        p->next = q->next;
+        *data   = q->data;
+        free(q);
+        q = NULL;
+
+        return 0;
+    }
+    else
+        return -2;
+}
+
+int list_delete(list *me, datatype *data)
+{
+    list *p = me, *q;
+    while (p->next && p->next->data != *data)
+        p = p->next;
+
+    if (NULL == p->next)
+        return -1;
+    else
+    {
+        q       = p->next;
+        p->next = q->next;
+        free(q);
+        q = NULL;
+    }
+
+    return 0;
+}
+
+int list_isempty(list *me)
+{
+    if (NULL == me->next)
+        return 0;
+    return 1;
+}
+
+void list_display(list *me)
+{
+    list *node = me->next;
+    if (0 == list_isempty(me))
+        return;
+
+    while (NULL != node)
+    {
+        printf("%d ", node->data);
+        node = node->next;
+    }
+    printf("\n");
+
+    return;
+}
+
+void list_destroy(list *me)
+{
+    list *node, *next;
+
+    for (node = me->next; node != NULL; node = next)
+    {
+        next = node->next;
+        free(node);
+    }
+
+    free(me);
+
+    return;
+}

C11-数据结构/ds/line/list/linklist/simple/head/list.h

@@ -0,0 +1,26 @@
+#ifndef LIST_H__
+#define LIST_H__
+
+typedef int datatype;
+
+typedef struct node_st
+{
+    datatype data;
+    struct node_st *next;
+}list;
+
+list *list_create();
+
+int list_insert_at(list *me, int i, datatype *data);
+int list_order_insert(list *me, datatype *data);
+
+int list_delete_at(list *me, int i, datatype *data);
+int list_delete(list *me, datatype *data);
+
+int list_isempty(list *me);
+
+void list_display(list *me);
+void list_destroy(list *me);
+
+
+#endif

C11-数据结构/ds/line/list/linklist/simple/head/main.c

@@ -0,0 +1,44 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "list.h"
+
+int main()
+{
+    list    *l;
+    datatype arr[] = {12, 9, 23, 2, 34, 6, 45};
+
+    l = list_create();
+    if (NULL == l)
+        exit(1);
+
+    for (int i = 0; i < sizeof(arr) / sizeof(*arr); i++)
+    {
+        // if (list_insert_at(l, 0, &arr[i]))
+        if (list_order_insert(l, &arr[i]))
+            exit(1);
+    }
+
+    list_display(l);
+
+    datatype value;
+    int      err;
+
+    err = list_delete_at(l, 2, &value);
+    if (err)
+        exit(1);
+    list_display(l);
+    printf("delete:%d\n", value);
+
+
+
+#if 0
+    int value = 12;
+    list_delete(l, &value);
+    list_display(l);
+#endif
+
+    list_destroy(l);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/simple/head/makefile

@@ -0,0 +1,7 @@
+all:main
+
+main:main.o list.o
+	$(CC) $^ -o $@
+
+clean:
+	rm *.o main -rf

C11-数据结构/ds/line/list/linklist/simple/josephu/jose.c

@@ -0,0 +1,117 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define JOSE_NUM 8
+
+typedef struct node_st
+{
+    int             data;
+    struct node_st *next;
+} list;
+
+// try something
+#if 0
+list *jose_create(int a[], int n)
+{
+    list *me, *p;
+    me = malloc(sizeof(*me));
+    if (NULL == me)
+        return NULL;
+
+    for (int i = 0; i < n; i++)
+    {
+        me->data = me;
+
+        p        = malloc(sizeof(*p));
+        p        = me;
+        p->data  = a[i];
+        me->next = p;
+    }
+
+    return me;
+}
+#endif
+
+list *jose_create(int n)
+{
+    list *me, *newnode, *cur;
+    int   i = 1;
+
+    me = malloc(sizeof(*me));
+    if (NULL == me)
+        return NULL;
+    me->data = i;
+    me->next = me;
+    i++;
+
+    cur = me;
+
+    for (; i <= n; i++)
+    {
+        newnode = malloc(sizeof(*newnode));
+        if (NULL == newnode)
+            return NULL;
+        newnode->data = i;
+        newnode->next = me;
+
+        cur->next = newnode;
+        cur       = newnode;
+    }
+
+    return me;
+}
+
+void jose_show(list *me)
+{
+    list *list;
+
+    for (list = me; list->next != me; list = list->next)
+    {
+        // sleep(1);
+        printf("%d ", list->data);
+        // fflush(NULL);
+    }
+    printf("%d\n", list->data);
+}
+
+void jose_kill(list **me, int n)
+{
+    list *cur = *me, *node;
+    int   i   = 1;
+
+    while (cur != cur->next)
+    {
+        while (i < n)
+        {
+            node = cur;
+            cur  = cur->next;
+            i++;
+        }
+
+        printf("%d ", cur->data);
+        node->next = cur->next;
+        free(cur);
+
+        cur = node->next;
+        i   = 1;
+    }
+
+    *me = cur;
+
+    printf("\n");
+}
+
+int main()
+{
+    list *list;
+
+    list = jose_create(JOSE_NUM);
+
+    jose_show(list);
+
+    jose_kill(&list, 3);
+
+    jose_show(list);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/simple/nohead/main.c

@@ -0,0 +1,48 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "nohead.h"
+
+int main()
+{
+    int             i, ret;
+    struct node_st *list = NULL;
+    struct score_st tmp;
+
+    for (i = 0; i < 7; i++)
+    {
+        tmp.id = i;
+        snprintf(tmp.name, NAMESIZE, "stu%d", i);
+        tmp.math    = rand() % 100;
+        tmp.chinese = rand() % 100;
+
+        // list = list_insert(list, &tmp);
+        ret = list_insert(&list, &tmp);
+        if (0 != ret)
+            exit(1);
+    }
+
+
+    list_show(list);
+
+    printf("\n\n");
+
+    int              id = 13;
+    struct score_st *ptr;
+    ptr = list_find(&list, id);
+    if (NULL == ptr)
+        printf("Can not find!\n");
+    else
+        printf("%d %s %d %d", ptr->id, ptr->name, ptr->math, ptr->chinese);
+
+
+#if 0
+    list_delete(&list);
+
+    list_show(list);
+#endif
+
+    list_destroy(&list);
+
+    exit(0);
+}

C11-数据结构/ds/line/list/linklist/simple/nohead/makefile

@@ -0,0 +1,7 @@
+all:main
+
+main:main.o nohead.o
+	$(CC) $^ -o $@
+
+clean:
+	rm *.o main -rf

C11-数据结构/ds/line/list/linklist/simple/nohead/nohead.c

@@ -0,0 +1,106 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "nohead.h"
+
+
+#if 0
+struct node_st *list_insert(struct node_st *list, struct score_st *data)
+{
+    struct node_st *new;
+
+    new = malloc(sizeof(*new));
+    if (NULL == new)
+        return NULL;
+
+    new->data = *data;
+    new->next = list;
+    list      = new;
+
+    return list;
+}
+#endif
+
+int list_insert(struct node_st **list, struct score_st *data)
+{
+    struct node_st *new;
+
+    new = malloc(sizeof(*new));
+    if (NULL == new)
+        return -1;
+
+    new->data = *data;
+    new->next = *list;
+    *list     = new;
+
+    return 0;
+}
+
+void list_show(struct node_st *list)
+{
+    struct node_st *cur;
+
+    for (cur = list; NULL != cur; cur = cur->next)
+    {
+        printf("%d %s %d %d\n",
+               cur->data.id,
+               cur->data.name,
+               cur->data.math,
+               cur->data.chinese);
+    }
+}
+
+// 删除首位
+int list_delete(struct node_st **list)
+{
+    struct node_st *cur;
+
+    if (NULL == *list)
+        return -1;
+
+    cur   = *list;
+    *list = (*list)->next;
+
+    free(cur);
+
+    return 0;
+}
+
+struct score_st *list_find(struct node_st **list, int id)
+{
+    struct node_st *cur;
+
+    if (NULL == *list)
+        return NULL;
+
+    // for (cur = *list; NULL != cur->next; cur = cur->next)
+    // !!! 是cur不为空
+    for (cur = *list; NULL != cur; cur = cur->next)
+    {
+        if (id == cur->data.id)
+        {
+            // printf("%d %s %d %d\n",
+            //        cur->data.id,
+            //        cur->data.name,
+            //        cur->data.math,
+            //        cur->data.chinese);
+            return &(cur->data);
+        }
+    }
+
+    return NULL;
+}
+
+int list_destroy(struct node_st **list)
+{
+    struct node_st *cur;
+
+    if (NULL == list)
+        return -1;
+
+    for (cur = *list; NULL != cur; cur = *list)
+    {
+        *list = cur->next;
+        free(cur);
+    }
+}

C11-数据结构/ds/line/list/linklist/simple/nohead/nohead.h

@@ -0,0 +1,26 @@
+#define NAMESIZE 32
+
+struct score_st
+{
+    int  id;
+    char name[NAMESIZE];
+    int  math;
+    int  chinese;
+};
+
+struct node_st
+{
+    struct score_st data;
+    struct node_st *next;
+};
+
+// struct node_st *list_insert(struct node_st *list, struct score_st *data);
+int list_insert(struct node_st **list, struct score_st *data);
+
+void list_show(struct node_st *list);
+
+int list_delete(struct node_st **list);
+
+struct score_st *list_find(struct node_st **list, int id);
+
+int list_destroy(struct node_st **list);

C11-数据结构/ds/line/list/linklist/simple/polynomial/poly.c

@@ -0,0 +1,114 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+typedef struct node_st
+{
+    int             coef;
+    int             exp;
+    struct node_st *next;
+} list;
+
+list *poly_create(int a[][2], int n)
+{
+    list *me, *newnode, *cur;
+
+    me = malloc(sizeof(me));
+    if (NULL == me)
+        return NULL;
+    me->next = NULL;
+
+    cur = me;
+
+    for (int i = 0; i < n; i++)
+    {
+        newnode = malloc(sizeof(*newnode));
+        if (NULL == newnode)
+            return NULL;
+
+        newnode->coef = a[i][0];
+        newnode->exp  = a[i][1];
+        newnode->next = NULL;
+
+        cur->next = newnode;
+        cur       = newnode;
+    }
+
+    return me;
+}
+
+void poly_show(list *me)
+{
+    list *cur;
+
+    for (cur = me->next; NULL != cur; cur = cur->next)
+    {
+        printf("(%d %d) ", cur->coef, cur->exp);
+    }
+    printf("\n");
+}
+
+void poly_union(list *p1, list *p2)
+{
+    list *p, *q, *r;
+
+    p = p1->next;
+    q = p2->next;
+    r = p1;
+
+    while (p && q)
+    {
+        if (p->exp < q->exp)
+        {
+            r->next = p;
+            r       = p;
+            p       = p->next;
+        }
+        else if (p->exp > q->exp)
+        {
+            r->next = q;
+            r       = q;
+            q       = q->next;
+        }
+        else
+        {
+            p->coef += q->coef;
+            if (p->coef)
+            {
+                r->next = p;
+                r       = p;
+            }
+
+            p = p->next;
+            q = q->next;
+        }
+    }
+
+    if (NULL == p)
+        r->next = q;
+    else
+        r->next = p;
+}
+
+int main()
+{
+    int a[][2] = {{5, 0}, {2, 1}, {8, 8}, {3, 16}};
+    int b[][2] = {{6, 1}, {16, 6}, {-8, 8}};
+
+    list *p1, *p2;
+
+    p1 = poly_create(a, 4);
+    if (NULL == p1)
+        exit(1);
+
+    p2 = poly_create(b, 3);
+    if (NULL == p2)
+        exit(1);
+
+    poly_show(p1);
+    poly_show(p2);
+
+    poly_union(p1, p2);
+    poly_show(p1);
+
+    exit(0);
+}