LeetCode:找出并返回可以覆盖所有房屋的最小加热半径.

Winter is coming!Your first job during the contest is to design a standard heater with fixed warm
all the houses.
Now,you are given positions of houses and heaters on a horizontal line,find out a 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 separately,and your expected output will
be the minimum radius standard of heaters.

Note:
1.Numbers of houses and heaters you are given are non-negative and will not exceed 25000.
2.Positions of houses and heaters you are given are non-negative and will not exceed 10^9.
3.As long as a house is in the heaters' warm radius range,it can be warmed.
4.All the heaters follow your radius standard, and the warm radius will the same.

Example 1:
Input:houses=[1,2,3],heaters=[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:houses=[1,2,3,4],heaters=[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:
暴力破解,先对heaters中的每个热水器统计到houses中的每个房屋的距离,存储在一个大小与houses相等的数组ans中,在统计过程中
若已经存在则取最小值,遍历完所有的heaters后.再枚举ans中选取最大值,则为覆盖房屋的最小加热半径.
超出时间限制.

方法2:
二分查找.在查找距离房子最近的供暖器的时候,先将供暖器进行排序,然后二分查找.其他思路和上面一致.

Go语言实现

package main

import (
	"fmt"
	"math"
	"sort"
)

//暴力破解,超时
func findRadiusOne(houses []int,heaters []int) int{
	ans:=make([]int,len(houses))
	for i,_:=range ans{
		ans[i]=math.MaxInt64
	}
	for i:=0;i<len(heaters);i++{
		for j:=0;j<len(houses);j++{
			ans[j]=min(ans[j],int(math.Abs(float64(houses[j]-heaters[i])))) //类型转换
			//直接abs函数 ,abs(houses[j]-heaters[i])
		}
	}
	res:=0
	for _,num:=range ans{
		res=max(res,num)
	}
	return res
}

func max(a,b int)int{
	if a>b{
		return a
	}
	return b
}

func min(a,b int)int{
	if a>b{
		return b
	}
	return a
}

//优化算法
func findRadiusTwo(houses []int,heaters []int) int{
	minRad:=0
	sort.Ints(heaters) //先对供暖器进行排序
	for _,house:=range houses{
		//遍历房子的坐标,维护heaters的最小半径
		heater:=findClosestHeater(house,heaters)//距离房子最近的供暖器
		rad:=heater-house

		if rad<0{
			rad=-rad
		}
		//全覆盖的供暖器最小半径,应达到最大的那个
		if rad>minRad{
			minRad=rad
		}
	}
	return minRad
}

func findClosestHeater(pos int,heaters []int)int{
	low,high:=0,len(heaters)-1
	//房子不在热水器范围内
	if pos<heaters[low]{
		return heaters[low]
	}
	if pos>heaters[high]{
		return heaters[high]
	}

	//二分查找
	for low<=high{
		mid:=(low+high)>>1
		if pos==heaters[mid]{
			return heaters[mid]
		}else if pos<heaters[mid]{
			high=mid-1
		}else{
			low=mid+1
		}
	}

	//判断距离两边的heaters哪个更近
	 if pos-heaters[high]<heaters[low]-pos{
	 	return heaters[high]
	 }
	return heaters[low]
}
func main(){
	houses,heaters:=[]int{1,5},[]int{2}
	fmt.Println(findRadiusOne(houses,heaters))
}