🌈 style:

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

@@ -3,9 +3,9 @@
 
 #include "list.h"
 
-list *list_create()
+list* list_create( )
 {
-    list *me;
+    list* me;
     me = malloc(sizeof(*me));
     if (NULL == me)
         return NULL;
@@ -16,7 +16,7 @@ list *list_create()
 }
 
 // 从第一个有效节点作为第0个
-int list_insert_at(list *me, int i, datatype *data)
+int list_insert_at(list* me, int i, datatype* data)
 {
     int   k    = 0;
     list *node = me, *newnode;
@@ -50,7 +50,7 @@ int list_insert_at(list *me, int i, datatype *data)
 }
 
 // 有序插入
-int list_order_insert(list *me, datatype *data)
+int list_order_insert(list* me, datatype* data)
 {
     list *p = me, *q;
 
@@ -68,7 +68,7 @@ int list_order_insert(list *me, datatype *data)
     return 0;
 }
 
-int list_delete_at(list *me, int i, datatype *data)
+int list_delete_at(list* me, int i, datatype* data)
 {
     int   k = 0;
     list *p = me, *q;
@@ -98,7 +98,7 @@ int list_delete_at(list *me, int i, datatype *data)
         return -2;
 }
 
-int list_delete(list *me, datatype *data)
+int list_delete(list* me, datatype* data)
 {
     list *p = me, *q;
     while (p->next && p->next->data != *data)
@@ -117,16 +117,16 @@ int list_delete(list *me, datatype *data)
     return 0;
 }
 
-int list_isempty(list *me)
+int list_isempty(list* me)
 {
     if (NULL == me->next)
         return 0;
     return 1;
 }
 
-void list_display(list *me)
+void list_display(list* me)
 {
-    list *node = me->next;
+    list* node = me->next;
     if (0 == list_isempty(me))
         return;
 
@@ -140,7 +140,7 @@ void list_display(list *me)
     return;
 }
 
-void list_destroy(list *me)
+void list_destroy(list* me)
 {
     list *node, *next;
 

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

@@ -5,22 +5,22 @@ typedef int datatype;
 
 typedef struct node_st
 {
-    datatype data;
-    struct node_st *next;
-}list;
+    datatype        data;
+    struct node_st* next;
+} list;
 
-list *list_create();
+list* list_create( );
 
-int list_insert_at(list *me, int i, datatype *data);
-int list_order_insert(list *me, datatype *data);
+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_delete_at(list* me, int i, datatype* data);
+int list_delete(list* me, datatype* data);
 
-int list_isempty(list *me);
+int list_isempty(list* me);
 
-void list_display(list *me);
-void list_destroy(list *me);
+void list_display(list* me);
+void list_destroy(list* me);
 
 
 #endif

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

@@ -3,12 +3,12 @@
 
 #include "list.h"
 
-int main()
+int main( )
 {
-    list    *l;
+    list*    l;
     datatype arr[] = {12, 9, 23, 2, 34, 6, 45};
 
-    l = list_create();
+    l = list_create( );
     if (NULL == l)
         exit(1);