# 875. Koko Eating Bananas

Koko loves to eat bananas.  There are `N` piles of bananas, the `i`-th pile has `piles[i]` bananas.  The guards have gone and will come back in `H` hours.

Koko can decide her bananas-per-hour eating speed of `K`.  Each hour, she chooses some pile of bananas, and eats K bananas from that pile.  If the pile has less than `K` bananas, she eats all of them instead, and won’t eat any more bananas during this hour.

Koko likes to eat slowly, but still wants to finish eating all the bananas before the guards come back.

Return the minimum integer `K` such that she can eat all the bananas within `H`hours.

Example 1:

``````Input: piles = [3,6,7,11], H = 8
Output: 4
``````

Example 2:

``````Input: piles = [30,11,23,4,20], H = 5
Output: 30
``````

Example 3:

``````Input: piles = [30,11,23,4,20], H = 6
Output: 23
``````

Note:

• `1 <= piles.length <= 10^4`
• `piles.length <= H <= 10^9`
• `1 <= piles[i] <= 10^9`

``````class Solution {
public:
int minEatingSpeed(vector<int>& piles, int H) {
int left = 1, right = 1e9;
while (left < right) {
int mid = left + (right - left) / 2, cnt = 0;
for (int pile : piles) cnt += (pile + mid - 1) / mid;
if (cnt > H) left = mid + 1;
else right = mid;
}
return right;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/875

Minimize Max Distance to Gas Station

https://leetcode.com/problems/koko-eating-bananas/

https://leetcode.com/problems/koko-eating-bananas/discuss/152324/C%2B%2BJavaPython-Binary-Search

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation