feat: add typescript solution to lc problem: No.2171

No.2171.Removing Minimum Number of Magic Beans

Author: zhaocchen

solution/2100-2199/2171.Removing Minimum Number of Magic Beans/README.md

@@ -78,7 +78,17 @@
 ### **TypeScript**
 
 ```ts
-
+function minimumRemoval(beans: number[]): number {
+    const n = beans.length;
+    let sum = beans.reduce((a, c) => a + c, 0);
+    beans.sort((a, b) => a - b);
+    let ans = sum;
+    for (let i = 0; i < n; i++) {
+        let num = beans[i];
+        ans = Math.min(sum - num * (n - i), ans);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2100-2199/2171.Removing Minimum Number of Magic Beans/README_EN.md

@@ -70,7 +70,17 @@ There are no other solutions that removes 7 beans or fewer.
 ### **TypeScript**
 
 ```ts
-
+function minimumRemoval(beans: number[]): number {
+    const n = beans.length;
+    let sum = beans.reduce((a, c) => a + c, 0);
+    beans.sort((a, b) => a - b);
+    let ans = sum;
+    for (let i = 0; i < n; i++) {
+        let num = beans[i];
+        ans = Math.min(sum - num * (n - i), ans);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2100-2199/2171.Removing Minimum Number of Magic Beans/Solution.ts

@@ -0,0 +1,11 @@
+function minimumRemoval(beans: number[]): number {
+    const n = beans.length;
+    let sum = beans.reduce((a, c) => a + c, 0);
+    beans.sort((a, b) => a - b);
+    let ans = sum;
+    for (let i = 0; i < n; i++) {
+        let num = beans[i];
+        ans = Math.min(sum - num * (n - i), ans);
+    }
+    return ans;
+};