875

Author: ProHiryu

BS/875.md

@@ -0,0 +1,32 @@
+## Koko Eating Bananas
+
+#### Description
+
+[link](https://leetcode.com/problems/koko-eating-bananas/)
+
+---
+
+#### Solution
+
+- See Code
+
+要注意边界，l要至少从1起步，其他就是标准的Binary Search问题
+
+---
+
+#### Code
+
+O(klog(n))
+
+```python
+class Solution:
+    def minEatingSpeed(self, piles: List[int], H: int) -> int:
+        l, r = 1, max(piles)
+        while l < r:
+            mid = l + (r - l) // 2
+            if sum([ceil(x / mid) for x in piles]) > H:
+                l = mid + 1
+            else:
+                r = mid
+        return l
+```