feat: add typescript solution to lcci problem: No.08.11.Coin (doocs#449)

Author: zhaocchen

lcci/08.11.Coin/README.md

@@ -41,6 +41,8 @@
 
 ## 解法
 
+完全背包问题
+
 <!-- 这里可写通用的实现逻辑 -->
 
 <!-- tabs:start -->
@@ -61,6 +63,23 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function waysToChange(n: number): number {
+    const MOD = 10 ** 9 + 7;
+    let coins = [1, 5, 10, 25];
+    let dp = new Array(n + 1).fill(0);
+    dp[0] = 1;
+    for (let coin of coins) {
+        for (let i = coin; i <= n; ++i) {
+            dp[i] += dp[i - coin];
+        }
+    }
+    return dp.pop() % MOD;
+};
+```
+
 ### **...**
 
 ```

lcci/08.11.Coin/README_EN.md

@@ -66,6 +66,23 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function waysToChange(n: number): number {
+    const MOD = 10 ** 9 + 7;
+    let coins = [1, 5, 10, 25];
+    let dp = new Array(n + 1).fill(0);
+    dp[0] = 1;
+    for (let coin of coins) {
+        for (let i = coin; i <= n; ++i) {
+            dp[i] += dp[i - coin];
+        }
+    }
+    return dp.pop() % MOD;
+};
+```
+
 ### **...**
 
 ```

lcci/08.11.Coin/Solution.ts

@@ -0,0 +1,12 @@
+function waysToChange(n: number): number {
+    const MOD = 10 ** 9 + 7;
+    let coins = [1, 5, 10, 25];
+    let dp = new Array(n + 1).fill(0);
+    dp[0] = 1;
+    for (let coin of coins) {
+        for (let i = coin; i <= n; ++i) {
+            dp[i] += dp[i - coin];
+        }
+    }
+    return dp.pop() % MOD;
+};