跳转至

875 爱吃香蕉的珂珂

思路

注意hour取值,使用long

class Solution {
public:
    long f(vector<int>& piles, int x){
        long hours = 0;
        for(int pile : piles){
            hours += pile / x;
            if(pile % x != 0)
                hours++;
        }
        return hours;
    }
    int minEatingSpeed(vector<int>& piles, int h) {
        // x的最小值
        int left = 1;
        // x的最大值
        int right = 0; 
        for(int pile : piles){
            right = max(right, pile);
        }
        while(left <= right){
            int mid = left + (right - left) / 2;
            if(f(piles, mid) == h){
                right = mid - 1;
            }else if(f(piles, mid) < h){
                right = mid - 1;
            }else if(f(piles, mid) > h){
                left = mid + 1;
            }
        }
        return left;
    }
};

针对题目给定的取值,1 <= piles[i] <= 10^9,我们直接让right取值10^9

class Solution {
public:
    long f(vector<int>& piles, int x){
        long hours = 0;
        for(int pile : piles){
            hours += pile / x;
            if(pile % x != 0)
                hours++;
        }
        return hours;
    }
    int minEatingSpeed(vector<int>& piles, int h) {
        // x的最小值
        int left = 1;
        // x的最大值
        int right = 1e9; 
        while(left <= right){
            long mid = left + (right - left) / 2;
            if(f(piles, mid) <= h){
                right = mid - 1;
            }else if(f(piles, mid) > h){
                left = mid + 1;
            }
        }
        return left;
    }
};