🌈 style:

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

@@ -6,7 +6,7 @@
 // !!! 课程不完整，程序未写完
 // TODO: snum和sop需要不同的datatype
 
-static void compute(sqstack *snum, int *op)
+static void compute(sqstack* snum, int* op)
 {
     datatype n1, n2, n;
 
@@ -25,7 +25,7 @@ static void compute(sqstack *snum, int *op)
     st_push(snum, &n);
 }
 
-static deal_bracket(sqstack *snum, sqstack *sop)
+static deal_bracket(sqstack* snum, sqstack* sop)
 {
     datatype old_op;
 
@@ -54,7 +54,7 @@ static int get_pri(int op)
 }
 
 
-static void deal_op(sqstack *snum, sqstack *sop, char op)
+static void deal_op(sqstack* snum, sqstack* sop, char op)
 {
     datatype old_op;
 
@@ -85,7 +85,7 @@ static void deal_op(sqstack *snum, sqstack *sop, char op)
 }
 
 
-int main()
+int main( )
 {
     int      i;
     char     str[] = "(11+3)*2-5";
@@ -94,11 +94,11 @@ int main()
     int      flag  = 0;
     int      old_op;
 
-    snum = st_create();
+    snum = st_create( );
     if (NULL == snum)
         exit(1);
 
-    sop = st_create();
+    sop = st_create( );
     if (NULL == sop)
         exit(1);
 

C11-数据结构/ds/line/compute/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, datatype *data)
+int st_push(sqstack* st, datatype* data)
 {
     if (MAXSIZE - 1 == st->top)
         return -1;
@@ -32,7 +32,7 @@ int st_push(sqstack *st, datatype *data)
 }
 
 /* 取出栈顶元素 */
-int st_pop(sqstack *st, datatype *data)
+int st_pop(sqstack* st, datatype* data)
 {
     if (st_isempty(st))
         return -1;
@@ -44,7 +44,7 @@ int st_pop(sqstack *st, datatype *data)
 
 
 /* 查看栈顶元素 */
-int st_top(sqstack *st, datatype *data)
+int st_top(sqstack* st, datatype* data)
 {
     if (st_isempty(st))
         return -1;
@@ -54,7 +54,7 @@ int st_top(sqstack *st, datatype *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/compute/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 *, datatype *);
+int st_push(sqstack*, datatype*);
 
 /* 取出栈顶元素 */
-int st_pop(sqstack *, datatype *);
+int st_pop(sqstack*, datatype*);
 
 /* 查看栈顶元素 */
-int st_top(sqstack *, datatype *);
+int st_top(sqstack*, datatype*);
 
-void st_travel(sqstack *);
+void st_travel(sqstack*);
 
-void st_destroy(sqstack *);
+void st_destroy(sqstack*);
 
 #endif