feat: add solutions to lc problems

Author: yanglbme

solution/2200-2299/2214.Minimum Health to Beat Game/README.md

@@ -68,6 +68,12 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：贪心**
+
+我们可以贪心地选择在伤害值最大的回合中使用一次护甲技能，假设伤害值最大为 $mx$，那么我们可以免受 $min(mx, armor)$ 的伤害，因此我们需要的最小生命值为 $sum(damage) - min(mx, armor) + 1$。
+
+时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为数组 `damage` 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -146,7 +152,15 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumHealth(damage: number[], armor: number): number {
+    let s = 0;
+    let mx = 0;
+    for (const v of damage) {
+        mx = Math.max(mx, v);
+        s += v;
+    }
+    return s - Math.min(mx, armor) + 1;
+}
 ```
 
 ### **...**

solution/2200-2299/2214.Minimum Health to Beat Game/README_EN.md

@@ -137,7 +137,15 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumHealth(damage: number[], armor: number): number {
+    let s = 0;
+    let mx = 0;
+    for (const v of damage) {
+        mx = Math.max(mx, v);
+        s += v;
+    }
+    return s - Math.min(mx, armor) + 1;
+}
 ```
 
 ### **...**

solution/2200-2299/2214.Minimum Health to Beat Game/Solution.ts

@@ -0,0 +1,9 @@
+function minimumHealth(damage: number[], armor: number): number {
+    let s = 0;
+    let mx = 0;
+    for (const v of damage) {
+        mx = Math.max(mx, v);
+        s += v;
+    }
+    return s - Math.min(mx, armor) + 1;
+}

solution/2500-2599/2549.Count Distinct Numbers on Board/README.md

@@ -111,6 +111,14 @@ func distinctIntegers(n int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function distinctIntegers(n: number): number {
+    return Math.max(1, n - 1);
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2549.Count Distinct Numbers on Board/README_EN.md

@@ -93,6 +93,14 @@ func distinctIntegers(n int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function distinctIntegers(n: number): number {
+    return Math.max(1, n - 1);
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2549.Count Distinct Numbers on Board/Solution.ts

@@ -0,0 +1,3 @@
+function distinctIntegers(n: number): number {
+    return Math.max(1, n - 1);
+}

solution/2500-2599/2550.Count Collisions of Monkeys on a Polygon/README.md

@@ -145,6 +145,27 @@ func qmi(a, k, p int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function monkeyMove(n: number): number {
+    const mod = BigInt(10 ** 9 + 7);
+    return Number((qmi(2n, n, mod) - 2n + mod) % mod);
+}
+
+function qmi(a: bigint, k: number, p: bigint): bigint {
+    let res = 1n;
+    while (k) {
+        if ((k & 1) === 1) {
+            res = (res * a) % p;
+        }
+        k >>= 1;
+        a = (a * a) % p;
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2550.Count Collisions of Monkeys on a Polygon/README_EN.md

@@ -128,6 +128,27 @@ func qmi(a, k, p int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function monkeyMove(n: number): number {
+    const mod = BigInt(10 ** 9 + 7);
+    return Number((qmi(2n, n, mod) - 2n + mod) % mod);
+}
+
+function qmi(a: bigint, k: number, p: bigint): bigint {
+    let res = 1n;
+    while (k) {
+        if ((k & 1) === 1) {
+            res = (res * a) % p;
+        }
+        k >>= 1;
+        a = (a * a) % p;
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2550.Count Collisions of Monkeys on a Polygon/Solution.ts

@@ -0,0 +1,16 @@
+function monkeyMove(n: number): number {
+    const mod = BigInt(10 ** 9 + 7);
+    return Number((qmi(2n, n, mod) - 2n + mod) % mod);
+}
+
+function qmi(a: bigint, k: number, p: bigint): bigint {
+    let res = 1n;
+    while (k) {
+        if ((k & 1) === 1) {
+            res = (res * a) % p;
+        }
+        k >>= 1;
+        a = (a * a) % p;
+    }
+    return res;
+}

solution/2500-2599/2551.Put Marbles in Bags/README.md

@@ -136,6 +136,24 @@ func putMarbles(weights []int, k int) (ans int64) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function putMarbles(weights: number[], k: number): number {
+    const n = weights.length;
+    const arr: number[] = [];
+    for (let i = 0; i < n - 1; ++i) {
+        arr.push(weights[i] + weights[i + 1]);
+    }
+    arr.sort((a, b) => a - b);
+    let ans = 0;
+    for (let i = 0; i < k - 1; ++i) {
+        ans += arr[n - i - 2] - arr[i];
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```