🌈 style:

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

@@ -3,13 +3,13 @@
 
 #include "queue.h"
 
-int main()
+int main( )
 {
-    queue   *sq;
+    queue*   sq;
     datatype arr[] = {2, 34, 89, 12};
     int      i;
 
-    sq = qu_create();
+    sq = qu_create( );
     if (NULL == sq)
         exit(1);
 

C11-数据结构/ds/line/squeue/arr/queue.c

@@ -4,9 +4,9 @@
 #include "queue.h"
 
 
-queue *qu_create()
+queue* qu_create( )
 {
-    queue *sq;
+    queue* sq;
 
     sq = malloc(sizeof(*sq));
     if (NULL == sq)
@@ -18,12 +18,12 @@ queue *qu_create()
     return sq;
 }
 
-int qu_isempty(queue *sq)
+int qu_isempty(queue* sq)
 {
     return (sq->head == sq->tail);
 }
 
-int qu_enqueue(queue *sq, datatype *x)
+int qu_enqueue(queue* sq, datatype* x)
 {
     if ((sq->tail + 1) % MAXSIZE == sq->head)
         return -1;
@@ -34,7 +34,7 @@ int qu_enqueue(queue *sq, datatype *x)
     return 0;
 }
 
-int qu_dequeue(queue *sq, datatype *x)
+int qu_dequeue(queue* sq, datatype* x)
 {
     if (qu_isempty(sq))
         return -1;
@@ -45,7 +45,7 @@ int qu_dequeue(queue *sq, datatype *x)
     return 0;
 }
 
-void qu_travel(queue *sq)
+void qu_travel(queue* sq)
 {
     if (sq->head == sq->tail)
         return;
@@ -61,12 +61,12 @@ void qu_travel(queue *sq)
     printf("%d \n", sq->data[i]);
 }
 
-void qu_clear(queue *sq)
+void qu_clear(queue* sq)
 {
     sq->head = sq->tail;
 }
 
-void qu_destroy(queue *sq)
+void qu_destroy(queue* sq)
 {
     free(sq);
 }

C11-数据结构/ds/line/squeue/arr/queue.h

@@ -12,18 +12,18 @@ typedef struct node_st
 } queue;
 
 
-queue *qu_create();
+queue* qu_create( );
 
-int qu_isempty();
+int qu_isempty( );
 
-int qu_enqueue(queue *, datatype *);
+int qu_enqueue(queue*, datatype*);
 
-int qu_dequeue(queue *, datatype *);
+int qu_dequeue(queue*, datatype*);
 
-void qu_travel(queue *);
+void qu_travel(queue*);
 
-void qu_clear(queue *);
+void qu_clear(queue*);
 
-void qu_destroy(queue *);
+void qu_destroy(queue*);
 
 #endif