LeetCode-475. Heaters

问题：https://leetcode.com/problems/heaters/?tab=Description
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.
冬天到了，需要利用加热器为房屋取暖。多个房屋和多个取暖器都在一条直线上，每个取暖器只能加热一段范围内的房屋。给定两个数组，分别表示房屋的坐标和取暖器的坐标，如果要求每个房屋都能够被加热，求出取暖器最小的加热范围半径。比如房屋坐标为[1,2,3]，取暖器坐标为[2]，那么取暖器的加热范围半径为1就可以为所有房屋取暖了。
分析：将heaters和houses先都按从小到大排序。前面的一个房子先找到离他最近的热水器，那么后面的房子找的热水器一定是这个热水器或者之后的热水器。找到每个房子和他最近的热水器之间的距离，再求得最大距离就是题目要求的半径了。
C++代码：

class Solution {
public:
    int findRadius(vector<int>& houses, vector<int>& heaters) {
        int lo=houses.size();
        int le=heaters.size();
        int r=0;
        int lr=0;
        int t=0;
        sort(houses.begin(),houses.end());
        sort(heaters.begin(),heaters.end());
        for(int i=0;i<lo;i++){
            int d=abs(heaters[t]-houses[i]);
            for(int j=t+1;j<le;j++){
                if(d>=abs(heaters[j]-houses[i])){
                    d=abs(heaters[j]-houses[i]);
                    t=j;
                }
                else break;
            }
            lr=max(lr,d);
        }
        return lr;
    }
};