🌈 style:

C07-函数/arr.c

@@ -1,20 +1,21 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-void print_arr(int *p, int size)
+void print_arr(int* p, int size)
 {
     int i;
     printf("%s:%d\n", __FUNCTION__, sizeof(p));
     // out: 8 指针
 
-    for (i = 0; i < size; i++) printf("%d ", *(p + i));
+    for (i = 0; i < size; i++)
+        printf("%d ", *(p + i));
     printf("\n");
 }
 
 
-void func(int *p, int size)
+void func(int* p, int size)
 {
-    int *tmp;
+    int* tmp;
 
     for (int i = 0; i < size / 2; i++)
     {
@@ -24,7 +25,7 @@ void func(int *p, int size)
     }
 }
 
-int main()
+int main( )
 {
     int a[] = {1, 3, 5, 7, 9};
 

C07-函数/chararr.c

@@ -2,9 +2,9 @@
 #include <stdlib.h>
 
 
-char *mystrcpy(char *dest, const char *src)
+char* mystrcpy(char* dest, const char* src)
 {
-    char *ret = dest;
+    char* ret = dest;
     if (NULL != dest && NULL != src)
         while ((*dest++ = *src++) != '\0')
             ;
@@ -12,7 +12,7 @@ char *mystrcpy(char *dest, const char *src)
     return ret;
 }
 
-char *mystrncpy(char *dest, const char *src, size_t n)
+char* mystrncpy(char* dest, const char* src, size_t n)
 {
     int i;
     for (i = 0; i < n && (dest[i] = src[i]); i++)
@@ -25,7 +25,7 @@ char *mystrncpy(char *dest, const char *src, size_t n)
 }
 
 
-int main()
+int main( )
 {
     char str1[] = "helloworld";
     char str2[128];

C07-函数/douarr.c

@@ -4,7 +4,7 @@
 #define M 3
 #define N 4
 
-void print_douarr(int *p, int n)
+void print_douarr(int* p, int n)
 {
     int i, j;
 
@@ -33,7 +33,7 @@ void print_douarr1(int (*p)[N], int m, int n)
     }
 }
 
-float average_score(int *p, int n)
+float average_score(int* p, int n)
 {
     float sum = 0;
 
@@ -57,14 +57,14 @@ void find_num(int (*p)[N], int num)
 }
 #endif
 
-int *find_num(int (*p)[N], int num)
+int* find_num(int (*p)[N], int num)
 {
     if (num > M - 1)
         return NULL;
     return *(p + num);
 }
 
-int main()
+int main( )
 {
     int i, j;
     int a[M][N] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
@@ -76,7 +76,7 @@ int main()
 
     // find_num(a, 2);
 
-    int *res;
+    int* res;
 
     res = find_num(a, 2);
     if (NULL != res)

C07-函数/fun_point.c

@@ -11,7 +11,7 @@ int sub(int a, int b)
     return a - b;
 }
 
-int main()
+int main( )
 {
     int a = 3, b = 5;
     int ret;

C07-函数/func.c

@@ -11,7 +11,7 @@ void b(void)
 {
     printf("[%s]begin!\n", __FUNCTION__);
     printf("[%s]call c()!\n", __FUNCTION__);
-    c();
+    c( );
     printf("[%s]c() returned!\n", __FUNCTION__);
     printf("[%s]end!\n", __FUNCTION__);
 }
@@ -20,16 +20,16 @@ void a(void)
 {
     printf("[%s]begin!\n", __FUNCTION__);
     printf("[%s]call b()!\n", __FUNCTION__);
-    b();
+    b( );
     printf("[%s]b() returned!\n", __FUNCTION__);
     printf("[%s]end!\n", __FUNCTION__);
 }
 
-int main()
+int main( )
 {
     printf("[%s]begin!\n", __FUNCTION__);
     printf("[%s]call a()!\n", __FUNCTION__);
-    a();
+    a( );
     printf("[%s]a() returned!\n", __FUNCTION__);
     printf("[%s]end!\n", __FUNCTION__);
     // out:

C07-函数/hello.c

@@ -4,9 +4,9 @@
 void print_hello(void);
 
 // 主调函数
-int main()
+int main( )
 {
-    print_hello();
+    print_hello( );
 
     exit(0);
 }

C07-函数/main.c

@@ -1,7 +1,7 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-int main(int argc, char *argv[])
+int main(int argc, char* argv[])
 {
 
     printf("argc = %d\n", argc);
@@ -9,7 +9,8 @@ int main(int argc, char *argv[])
 
     // for (int i = 0; i < argc; i++) puts(argv[i]);
 
-    for (int i = 0; argv[i] != NULL; i++) puts(argv[i]);
+    for (int i = 0; argv[i] != NULL; i++)
+        puts(argv[i]);
 
     // printf("Hello!\n");
 

C07-函数/min_max.c

@@ -22,7 +22,7 @@ int dist(int a, int b, int c)
     return max(a, b, c) - min(a, b, c);
 }
 
-int main()
+int main( )
 {
     int a = 3, b = 5, c = 10;
 

C07-函数/swap.c

@@ -18,7 +18,7 @@ int print_value(int a, int b)
 //     j   = tmp;
 // }
 
-void swap(int *p, int *q)
+void swap(int* p, int* q)
 {
     int tmp;
 
@@ -26,7 +26,7 @@ void swap(int *p, int *q)
     *p  = *q;
     *q  = tmp;
 }
-int main()
+int main( )
 {
     int i = 3, j = 5;