feat: add c solution to lcp problems: No.01,06

- No.LCP 01. 猜数字
- No.LCP 06. 拿硬币

Author: YangFong

lcp/LCP 01. 猜数字/README.md

@@ -111,6 +111,20 @@ var game = function (guess, answer) {
 };
 ```
 
+### **C**
+
+```c
+int game(int* guess, int guessSize, int* answer, int answerSize) {
+    int res = 0;
+    for (int i = 0; i < 3; i++) {
+        if (guess[i] == answer[i]) {
+            res++;
+        }
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

lcp/LCP 01. 猜数字/Solution.c

@@ -0,0 +1,9 @@
+int game(int* guess, int guessSize, int* answer, int answerSize) {
+    int res = 0;
+    for (int i = 0; i < 3; i++) {
+        if (guess[i] == answer[i]) {
+            res++;
+        }
+    }
+    return res;
+}

lcp/LCP 06. 拿硬币/README.md

@@ -88,6 +88,22 @@ func minCount(coins []int) int {
 }
 ```
 
+### **C**
+
+```c
+int minCount(int* coins, int coinsSize) {
+    int res = 0;
+    for (int i = 0 ; i < coinsSize; i++) {
+        int coin = coins[i];
+        if (coin % 2 == 1) {
+            res++;
+        }
+        res += coin / 2;
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

lcp/LCP 06. 拿硬币/Solution.c

@@ -0,0 +1,11 @@
+int minCount(int* coins, int coinsSize) {
+    int res = 0;
+    for (int i = 0 ; i < coinsSize; i++) {
+        int coin = coins[i];
+        if (coin % 2 == 1) {
+            res++;
+        }
+        res += coin / 2;
+    }
+    return res;
+}