Description
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.
Examples
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
Constraints:
1 <= piles.length <= 1 0 4 10^4 104
piles.length <= h <= 1 0 9 10^9 109
1 <= piles[i] <= 1 0 9 10^9 109
思路
是二分查找,注意一下递归退出条件是>而不是 ≥
代码
class Solution {
public boolean canEat(int[] piles, int speed, int hour){
int count = 0;
for (int pile: piles){
count += (pile % speed == 0)? ((int)(pile / speed)): ((int)(pile / speed) + 1);
}
if (count - hour > 0)
return false;
else
return true;
}
public int recursive(int[] piles, int low_speed, int high_speed, int hour){
if (low_speed >= high_speed)
return low_speed;
int mid = (int)((low_speed + high_speed) / 2);
if (canEat(piles, mid, hour))
return recursive(piles, low_speed, mid - 1, hour);
else
return recursive(piles, mid + 1, high_speed, hour);
}
public int minEatingSpeed(int[] piles, int h) {
int count = 0;
for (int pile: piles){
count += pile;
}
return recursive(piles, (int)(count / h), count, h);
}
}