# 原题链接

https://leetcode.com/problems/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.


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.

# 解法

public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(houses);
Arrays.sort(heaters);

int posMin = houses[0] > heaters[0] ? heaters[0] : houses[0];
int posMax = houses[houses.length - 1] > heaters[heaters.length - 1] ? houses[houses.length - 1] : heaters[heaters.length - 1];

HashMap<Integer, Boolean> heaterMap = new HashMap<Integer, Boolean>();
// add to HashMap, to increase search speed.
for (int i = 0; i < heaters.length; i++) {
heaterMap.put(heaters[i], true);
}

int max = 0;
for (int i = 0; i < houses.length; i++) {
int pos = houses[i];
for (int j = 0; pos - j >= posMin || pos + j <= posMax; j++) {
// try to search left or right, onece found, judge max and break;
if (heaterMap.containsKey(pos - j)) {
max = (max < j? j : max);
break;
}
if (heaterMap.containsKey(pos + j)) {
max = (max < j? j : max);
break;
}
}
}

return max;
}

public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(houses);
Arrays.sort(heaters);

int left = 0, right = heaters.length - 1;
int[] lefts = new int[houses.length];
int[] rights = new int[houses.length];
for (int i = 0; i < houses.length; i++) {
while (left < heaters.length && heaters[left] <= houses[i]) {
lefts[i] = left + 1;
left++;
}
left = lefts[i] != 0 ? (lefts[i] - 1) : 0;
while (right >= left && heaters[right] >= houses[i]) {
rights[i] = right + 1;
right--;
}
right = heaters.length - 1;
}

int ret = 0;
for (int i = 0; i < houses.length; i++) {
int min = Integer.MAX_VALUE;
if (lefts[i] != 0) {
min = Math.min(houses[i] - heaters[lefts[i] - 1], min);
}
if (rights[i] != 0) {
min = Math.min(heaters[rights[i] - 1] - houses[i], min);
}
ret = Math.max(min, ret);
}

System.out.println(ret);
return ret;
}

Top解法：这是Discuss中的top解法。先将取暖器数组排序，在遍历所有house，对每个house，在取暖器数组中进行binary search，如果命中，则说明取暖器位置和house位置重合，这个house的最小半径为0；如果没有命中，则使用返回的index，将index左边和右边的取暖器坐标与house坐标求差值，找出这个house最小半径。说白了，也是在查找house的最近左右取暖器，只是这种解法，非常清晰简单，令人佩服。

public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(heaters);
int result = 0;

for (int house : houses) {
int index = Arrays.binarySearch(heaters, house);
if (index < 0) {
index = ~index;
int dist1 = index - 1 >= 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;
int dist2 = index < heaters.length ? heaters[index] - house : Integer.MAX_VALUE;

result = Math.max(result, Math.min(dist1, dist2));
}
}

return result;
}

# 测试用例：

public static void main(String[] args) {
Solution s = new Solution();
{
int[] house = {1,2,3,4};
int[] heaters = {1,4};
}
{
int[] house = {1,5};
int[] heaters = {10};
}
{
int[] house = {1,2,3};
int[] heaters = {2};
}
{
int[] house = {7,9, 1};
int[] heaters = {2};
}