LeetCode 475. Heaters

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.

Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all houses could be covered by those heaters.

So, your input will be the positions of houses and heaters seperately, and your expected output will be the minimum radius standard of heaters.

Note:

Numbers of houses and heaters you are given are non-negative and will not exceed 25000.
Positions of houses and heaters you are given are non-negative and will not exceed 10^9.
As long as a house is in the heaters’ warm radius range, it can be warmed.
All the heaters follow your radius standard and the warm radius will the same.
题目大意 给出一些房子 和 加热器 求一个最小的半径 使所有房间可以被加热器笼罩。由于是存在单调性的 我们用二分来处理 时间复杂度O(nlogn+mlogm+(n+m)logL)

class Solution {
public:
    bool judge(vector<int>& houses,vector<int>& heaters,int mid)
    {
        int n = heaters.size();
        int m = houses.size();
        for(int i=0,j=0;i<houses.size();i++){
            while(j<n&&abs(houses[i]-heaters[j])>mid)
                j++;
            if(j==n)
                return false;
        }
    return true;
    }
    int findRadius(vector<int>& houses, vector<int>& heaters) {
    int res=0;
    sort(houses.begin(),houses.end());
    sort(heaters.begin(),heaters.end());
    if(houses.size()==0)
        return 0;
    int l=0,r=max(*houses.rbegin(), *heaters.rbegin());
    while(l<r)
    {
        int mid=l+r>>1;
        if(judge(houses,heaters,mid))
            r=mid;
        else
            l=mid+1;
    }
        return l;
    }
};