Leetcode 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 k. Each hour, she chooses a pile and eats k bananas from it. If the pile has fewer than k bananas, she eats all of them and does not eat any more bananas during that hour.
Koko likes to eat slowly but still wants to finish 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 <= 10^4piles.length <= h <= 10^91 <= piles[i] <= 10^9