add 2279

fishercoder1534 · fishercoder1534 · commit b2e02b2fe29a · 2022-05-21T21:27:06.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
-| 2270  |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)                                                                     || Medium                                                                        ||
+| 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java)                                                                     || Medium                                                                        ||
+| 2270 |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)                                                                     || Medium                                                                        ||
 | 2269 |[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2269.java)                                                                     || Easy                                                                          ||
 | 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java)                                                                     || Easy                                                                          ||
 | 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java)                                                                     || Medium                                                                        ||
diff --git a/src/main/java/com/fishercoder/solutions/_2279.java b/src/main/java/com/fishercoder/solutions/_2279.java
@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2279 {
+    public static class Solution1 {
+        public int maximumBags(int[] capacity, int[] rocks, int additionalRocks) {
+            int[] delta = new int[capacity.length];
+            int ans = 0;
+            for (int i = 0; i < capacity.length; i++) {
+                if (capacity[i] == rocks[i]) {
+                    ans++;
+                } else {
+                    delta[i] = capacity[i] - rocks[i];
+                }
+            }
+            Arrays.sort(delta);
+            for (int i = 0; i < capacity.length; i++) {
+                if (delta[i] != 0) {
+                    if (additionalRocks >= delta[i]) {
+                        ans++;
+                        additionalRocks -= delta[i];
+                    }
+                }
+            }
+            return ans;
+        }
+    }
+}
