# LeetCode-Heaters

xiaoxiao2021-03-01  7

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.你被给定的房屋和加热器的数量是正的并且不超过25000。

2.你被给定的房屋和加热器的位置是正的并且不超过10^9。

3.房屋是温暖的，只要房屋在加热器的加热半径范围内。

4.所有的加热器都遵循你的半径标准，温暖的半径也是一样的。

C++ 代码（Visual studio 2017）：

#include "stdafx.h" #include <iostream> #include <vector> #include <algorithm> using namespace std; class Solution { public: int findRadius(vector<int>& houses, vector<int>& heaters) { int result=0; sort(houses.begin(), houses.end()); sort(heaters.begin(), heaters.end()); int j = 0; for (int i = 0; i < houses.size(); i++) { while (j < heaters.size() - 1 && abs(heaters[j] - houses[i]) >= abs(heaters[j + 1] - houses[i])) { j++; } result = max(result, abs(heaters[j] - houses[i])); } return result; } }; int main() { Solution s; vector<int> houses = { 1,2,3,4 }; vector<int> heaters = { 1,4 }; int result; result = s.findRadius(houses, heaters); cout << result; return 0; }