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.
冬天来了!比赛期间,您的第一份工作是设计一个具有固定温度半径的标准加热器来加热所有房屋。 现在,您在水平线上获得房屋和加热器的位置,找出加热器的最小半径,以便所有房屋都可以被这些加热器覆盖。 因此,您的投入将分别是房屋和加热器的位置,您的预期输出将是加热器的最小半径标准。
注意: 房屋和加热器的数量是非负数,不超过25000。 房屋和加热器的位置是非负的,不超过10 ^ 9。 只要房子处于加热器的半径范围内,就可以加热。 所有加热器都遵循半径标准,温度半径将相同。
class Solution(object):
def findRadius(self, houses, heaters):
"""
:type houses: List[int]
:type heaters: List[int]
:rtype: int
"""
houses.sort()
heaters.sort()
res = 0
j = 0
for i in range(0, len(houses)):
while j < len(heaters) - 1 and abs(heaters[j + 1] - houses[i]) <= abs(heaters[j] - houses[i]):
j += 1
res = max(res, abs(heaters[j] - houses[i]))
return res