↩ revert:

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

@@ -16,7 +16,7 @@
 
 #define NR_BALL 27
 
-int check(queue* qu)
+int check(queue *qu)
 {
     int i = (qu->head + 1) % MAXSIZE;
 
@@ -33,7 +33,7 @@ int check(queue* qu)
 int main( )
 {
     int      i;
-    queue*   qu;
+    queue   *qu;
     int      t, value;
     int      time;
     sqstack *st_min, *st_fivemin, *st_hour;

C11-数据结构/ds/line/ball_clock/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/ball_clock/queue.h

@@ -12,18 +12,18 @@ typedef struct
 } queue;
 
 
-queue* qu_create( );
+queue *qu_create( );
 
 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

C11-数据结构/ds/line/ball_clock/sqstack.c

@@ -3,9 +3,9 @@
 
 #include "sqstack.h"
 
-sqstack* st_create(void)
+sqstack *st_create(void)
 {
-    sqstack* st;
+    sqstack *st;
 
     st = malloc(sizeof(*st));
     if (NULL == st)
@@ -16,12 +16,12 @@ sqstack* st_create(void)
     return st;
 }
 
-int st_isempty(sqstack* st)
+int st_isempty(sqstack *st)
 {
     return (-1 == st->top);
 }
 
-int st_push(sqstack* st, type* data)
+int st_push(sqstack *st, type *data)
 {
     if (SIZE - 1 == st->top)
         return -1;
@@ -32,7 +32,7 @@ int st_push(sqstack* st, type* data)
 }
 
 /* 取出栈顶元素 */
-int st_pop(sqstack* st, type* data)
+int st_pop(sqstack *st, type *data)
 {
     if (st_isempty(st))
         return -1;
@@ -44,7 +44,7 @@ int st_pop(sqstack* st, type* data)
 
 
 /* 查看栈顶元素 */
-int st_top(sqstack* st, type* data)
+int st_top(sqstack *st, type *data)
 {
     if (st_isempty(st))
         return -1;
@@ -54,7 +54,7 @@ int st_top(sqstack* st, type* data)
     return 0;
 }
 
-void st_travel(sqstack* st)
+void st_travel(sqstack *st)
 {
     if (st_isempty(st))
         return;
@@ -66,7 +66,7 @@ void st_travel(sqstack* st)
     printf("\n");
 }
 
-void st_destroy(sqstack* st)
+void st_destroy(sqstack *st)
 {
     free(st);
 }

C11-数据结构/ds/line/ball_clock/sqstack.h

@@ -11,20 +11,20 @@ typedef struct node_st
     int  top;
 } sqstack;
 
-sqstack* st_create(void);
+sqstack *st_create(void);
 
-int st_isempty(sqstack*);
+int st_isempty(sqstack *);
 
-int st_push(sqstack*, type*);
+int st_push(sqstack *, type *);
 
 /* 取出栈顶元素 */
-int st_pop(sqstack*, type*);
+int st_pop(sqstack *, type *);
 
 /* 查看栈顶元素 */
-int st_top(sqstack*, type*);
+int st_top(sqstack *, type *);
 
-void st_travel(sqstack*);
+void st_travel(sqstack *);
 
-void st_destroy(sqstack*);
+void st_destroy(sqstack *);
 
 #endif