Table of Contents
Problem Description : Koko Eating Bananas
source: https://leetcode.com/problems/koko-eating-bananas/
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
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
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 <= 104piles.length <= h <= 1091 <= piles[i] <= 109
Python
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
class Solution: def minEatingSpeed(self, piles: List[int], h: int) -> int: # max possible speed mx = max(piles) if h == len(piles): return mx # h > len(piles) --> do binary search in solution space of [1,mx] def checkHours(speed): time = 0 for p in piles: time += p//speed if p % speed != 0: time += 1 return time <= h def binSearch(low, high): if low >= high: return low mid = (low + high) >> 1 if checkHours(mid): # mid satisfies the h hours time high = mid else: low = mid + 1 return binSearch(low, high) return binSearch(1, mx) |