这篇博客介绍了如何利用二分查找法解决LeetCode中的875题——猴子Koko吃香蕉问题。Koko要在管理员回来前吃完所有香蕉，她可以选择每小时吃k根香蕉，需要找到最小的k值。文章通过举例和解释题目，展示了如何运用二分查找策略，从1到最大香蕉数的区间中找到满足条件的最小k值。
Koko loves to eat bananas. There are n piles of bananas, the ith 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 will not eat any more bananas during this hour.
Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return.
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
最低0.47元/天 解锁文章
950
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
