leetcode1552题解【二分+贪心】

class Solution {
public:
    int maxDistance(vector<int>& position, int m) {
        sort(position.begin(), position.end());
        int len = position.size();
        int l = 1, r = position[len - 1] - position[0];
        while(l < r){
            int mid = l + r + 1>> 1;
            if(check(mid, position, m))
                l = mid;
            else
                r = mid - 1;
        }
        return l;
    }
    bool check(int k, vector<int>& position, int m){
        int len = position.size();
        int last = position[0];         //last用于记录上一个存放球的篮子的位置
        int t = 1;             //记录已经放入到篮子的球的个数
        for(int i = 1; i < len; i++){
            if(position[i] - last >= k){
                ++t;
                last = position[i];
                if(t == m) return true;
            }
        }
        return false;
    }
};