feat: add solutions to lcp problem: No.06

Author: thinkasany

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

@@ -104,6 +104,18 @@ int minCount(int* coins, int coinsSize) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minCount(coins: number[]): number {
+    let ans = 0;
+    for (const coin of coins) {
+        ans += Math.floor((coin + 1) / 2);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,7 @@
+function minCount(coins: number[]): number {
+    let ans = 0;
+    for (const coin of coins) {
+        ans += Math.floor((coin + 1) / 2);
+    }
+    return ans;
+}