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

思路：典型的二分答案的binary search。注意，min下限应该是1，而不是最小值，因为H可以无限大；

class Solution {
    public int minEatingSpeed(int[] piles, int h) {
        int start = 1;
        int end = 0;
        for(int pile: piles) {
            end = Math.max(end, pile);
        }
        while(start + 1 < end) {
            int mid = start + (end - start) / 2;
            if(needTime(mid, piles) <= h) {
                end = mid;
            } else {
                start = mid;
            }
        }
        if(needTime(start, piles) <= h) {
            return start;
        }
        return end;
    }
    
    private int needTime(int speed, int[] piles){
        int count = 0;
        for(int pile: piles) {
            count += pile / speed;
            if(pile % speed != 0) {
                count++;
            }
        }
        return count;
    }
}