475.Heaters

475.Heaters

难度:Easy

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.

Example 1:

Input: [1,2,3],[2]
Output: 1
Explanation: The only heater was placed in the position 2, and if we use the radius 1 standard, then all the houses can be warmed.
 

Example 2:

Input: [1,2,3,4],[1,4]
Output: 1
Explanation: The two heater was placed in the position 1 and 4. We need to use radius 1 standard, then all the houses can be warmed.

求最短半径，实际上是求每个点与前后暖气设备距离较小值的最大值。

class Solution {
public:
    int findRadius(vector<int>& houses, vector<int>& heaters) {
        if(heaters.size()==1) return max(heaters[0] - houses[0] , houses[houses.size() -1 ] - heaters[0]);
       sort(houses.begin(), houses.end());
       sort(heaters.begin(), heaters.end());
        int k=1;
        int start = heaters[0];
        int ed = heaters[1];
        int raidus= start-houses[0];
        if(start< houses[0]) raidus = min(ed-houses[0], houses[0]-start);
        int i=0;
        for(;i<houses.size();i++)
        if(houses[i] >=start) break;
        //cout<< raidus <<" "<< i<<endl;
        for(;i<houses.size();i++)
        {
            while(houses[i] > ed ) {
                start =ed;
                k++;
                if(k >= heaters.size()) ed = INT_MAX;
                else
                        ed = heaters[k];
            }
            raidus = max(raidus, min(houses[i]-start , ed -houses[i]));
        }
        return raidus;
    }

};

执行用时 :88 ms, 在所有 C++ 提交中击败了84.34%的用户 内存消耗 :11 MB, 在所有 C++ 提交中击败了88.89%的用户