solves #2335: Minimum Amount of Time to Fill Cups in java

Author: anishLearnsToCode

Diff for: README.md

@@ -749,7 +749,7 @@
 | 2319 | [Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix)                                                                               |                                                                                       [![Java](assets/java.png)](src/CountAsterisks.java)                                                                                        |                                                                                                                                   |
 | 2325 | [Decode the Message](https://leetcode.com/problems/decode-the-message)                                                                                                 |                                                                                      [![Java](assets/java.png)](src/DecodeTheMessage.java)                                                                                       |                                                                                                                                   |
 | 2331 | [Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree)                                                                             |                                                                                  [![Java](assets/java.png)](src/EvaluateBooleanBinaryTree.java)                                                                                  |                                                                                                                                   |
-| 2335 | [Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups)                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2335 | [Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups)                                                               |                                                                                [![Java](assets/java.png)](src/MinimumAmountOfTimeToFillCups.java)                                                                                |                                                                                                                                   |
 | 2439 | [Minimize Maximum of Array](https://leetcode.com/problems/minimize-maximum-of-array)                                                                                   |                                                                               [![Python](assets/python.png)](python/minimize_maximum_of_array.py)                                                                                |                                                                                                                                   |
 | 2341 | [Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array)                                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand)                                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |

Diff for: src/MinimumAmountOfTimeToFillCups.java

@@ -0,0 +1,14 @@
+// https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups
+// T: O(1)
+// S: O(1)
+
+import java.util.Arrays;
+
+public class MinimumAmountOfTimeToFillCups {
+    public int fillCups(int[] amount) {
+        return Math.max(
+                Arrays.stream(amount).max().getAsInt(),
+                (Arrays.stream(amount).sum() + 1) / 2
+        );
+    }
+}