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

No.2279.Maximum Bags With Full Capacity of Rocks

Author: zhaocchen

solution/2200-2299/2279.Maximum Bags With Full Capacity of Rocks/README.md

@@ -151,7 +151,17 @@ func maximumBags(capacity []int, rocks []int, additionalRocks int) int {
 ### **TypeScript**
 
 ```ts
-
+function maximumBags(capacity: number[], rocks: number[], additionalRocks: number): number {
+    const n = capacity.length;
+    const diffs = capacity.map((c, i) => c - rocks[i]);
+    diffs.sort((a, b) => a - b);
+    let ans = 0;
+    for (let i = 0; i < n && (diffs[i] === 0 || diffs[i] <= additionalRocks); i++) {
+        ans++;
+        additionalRocks -= diffs[i];
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2279.Maximum Bags With Full Capacity of Rocks/README_EN.md

@@ -140,7 +140,17 @@ func maximumBags(capacity []int, rocks []int, additionalRocks int) int {
 ### **TypeScript**
 
 ```ts
-
+function maximumBags(capacity: number[], rocks: number[], additionalRocks: number): number {
+    const n = capacity.length;
+    const diffs = capacity.map((c, i) => c - rocks[i]);
+    diffs.sort((a, b) => a - b);
+    let ans = 0;
+    for (let i = 0; i < n && (diffs[i] === 0 || diffs[i] <= additionalRocks); i++) {
+        ans++;
+        additionalRocks -= diffs[i];
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2279.Maximum Bags With Full Capacity of Rocks/Solution.ts

@@ -0,0 +1,11 @@
+function maximumBags(capacity: number[], rocks: number[], additionalRocks: number): number {
+    const n = capacity.length;
+    const diffs = capacity.map((c, i) => c - rocks[i]);
+    diffs.sort((a, b) => a - b);
+    let ans = 0;
+    for (let i = 0; i < n && (diffs[i] === 0 || diffs[i] <= additionalRocks); i++) {
+        ans++;
+        additionalRocks -= diffs[i];
+    }
+    return ans;
+};