add 2335

Author: fishercoder1534

README.md

@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                      || Easy                                                                             ||
+| 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java)                                                                     || Easy                                                                             ||
+| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                     || Easy                                                                             ||
 | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java)                                                                     || Medium                                                                        ||
 | 2325 |[Decode the Message](https://leetcode.com/problems/decode-the-message/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2325.java)                                                                     || Easy                                                                          ||
 | 2319 |[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2319.java)                                                                     || Easy                                                                          ||

src/main/java/com/fishercoder/solutions/_2335.java

@@ -0,0 +1,38 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+public class _2335 {
+    public static class Solution1 {
+        public int fillCups(int[] amount) {
+            PriorityQueue<Integer> heap = new PriorityQueue<>((a, b) -> b - a);
+            for (int num : amount) {
+                if (num > 0) {
+                    heap.offer(num);
+                }
+            }
+            int seconds = 0;
+            while (!heap.isEmpty()) {
+                if (heap.size() == 1) {
+                    seconds += heap.poll();
+                    return seconds;
+                }
+                int one = heap.poll();
+                one--;
+                if (!heap.isEmpty()) {
+                    int two = heap.poll();
+                    two--;
+                    if (two > 0) {
+                        heap.offer(two);
+                    }
+                }
+                if (one > 0) {
+                    heap.offer(one);
+                }
+                seconds++;
+            }
+            return seconds;
+        }
+
+    }
+}

src/test/java/com/fishercoder/_2335Test.java

@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2335;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2335Test {
+    private static _2335.Solution1 solution1;
+    private static int[] amount;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2335.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        amount = new int[]{5, 4, 4};
+        assertEquals(7, solution1.fillCups(amount));
+    }
+
+    @Test
+    public void test2() {
+        amount = new int[]{0, 0, 0};
+        assertEquals(0, solution1.fillCups(amount));
+    }
+
+}