更新了文件名。开始了数据结构

Chapter11/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;
+}

Chapter11/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

Chapter11/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);
+}

Chapter11/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

Chapter11/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);
+}

Chapter11/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

Chapter11/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);
+    }
+}

Chapter11/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);

Chapter11/数据结构.md

@@ -0,0 +1,35 @@
+# 数据结构
+
+## 架构梳理
+
+- 线性（1:1)
+
+  - 线性表
+
+    - 顺序存储  -->  arr
+
+    - 链式存储  -->  指针 （有头，无头）
+
+      有头是指有一个不存数据的头，始终作为这个链表的起点。
+
+      会更加简单，无头的话，更改首部节点会麻烦。
+
+      - 单链表
+        - 循环
+        - 不循环
+      - 双向链表
+        - 循环
+        - 不循环
+
+  - 栈
+
+  - 队列
+
+- 树状（1:N）
+
+  **递归**。**递归**转**非递归**。
+
+- 图（N:M）
+
+
+