Time: 32 ms (39.82%), Space: 88.3 MB (41.19%) - LeetHub

karygauss03 · karygauss03 · commit 9b3da19b322c · 2025-03-14T11:32:13.000+01:00
diff --git a/1335-maximum-candies-allocated-to-k-children/1335-maximum-candies-allocated-to-k-children.cpp b/1335-maximum-candies-allocated-to-k-children/1335-maximum-candies-allocated-to-k-children.cpp
@@ -0,0 +1,37 @@
+class Solution {
+public:
+    int maximumCandies(vector<int>& candies, long long k) {
+        int maxCandiesInPile = 0;
+        for (int i = 0; i < candies.size(); i++) {
+            maxCandiesInPile = max(maxCandiesInPile, candies[i]);
+        }
+
+        int left = 0;
+        int right = maxCandiesInPile;
+
+        while (left < right) {
+            int middle = (left + right + 1) / 2;
+            if (canAllocateCandies(candies, k, middle)) {
+                left = middle;
+            } else {
+                right = middle - 1;
+            }
+        }
+
+        return left;
+    }
+
+private:
+    bool canAllocateCandies(vector<int>& candies, long long k,
+                            int numOfCandies) {
+        long long int maxNumOfChildren = 0;
+
+        for (int pileIndex = 0; pileIndex < candies.size(); pileIndex++) {
+            maxNumOfChildren +=
+                candies[pileIndex] /
+                numOfCandies;
+        }
+
+        return maxNumOfChildren >= k;
+    }
+};
