動機
bsearch的用法
- 猜數字
- 找位置
Problem
Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses.
Every house can be warmed, as long as the house is within the heater's warm radius range.
Given the positions of houses and heaters on a horizontal line, return the minimum radius standard of heaters so that those heaters could cover all houses.
Notice that all the heaters follow your radius standard, and the warm radius will the same.
Example 1:
Input: houses = [1,2,3], heaters = [2]Output: 1Explanation: 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: 1Explanation: 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.
Example 3:
Input: houses = [1,5], heaters = [2]Output: 3
Constraints:
1 <= houses.length, heaters.length <= 3 * 1041 <= houses[i], heaters[i] <= 109
Sol
猜數字
class Solution:
def findRadius(self, houses: List[int], heaters: List[int]) -> int:
houses.sort()
heaters.sort()
def count(r):
i = 0
for h in heaters:
if i == len(houses):
break
elif abs(h-houses[i]) <= r:
while i < len(houses) and abs(h-houses[i]) <= r:
i += 1
return i == len(houses)
a,b = 0, max(heaters[-1]-houses[0], houses[-1]-houses[0])
while a<b:
mid = (a+b)//2
if count(mid):
#print(mid, True, a, mid)
b = mid
else:
#print(mid, False, mid+1, b)
a = mid+1
return a
找位置
class Solution:
def findRadius(self, houses: List[int], heaters: List[int]) -> int:
heaters.sort()
get = lambda l,i: l[i] if 0 <= i < len(l) else float('inf')
ret = 0
for h in houses:
x = bisect_right(heaters, h)
ret = max(ret, min(abs(get(heaters, x)-h), abs(get(heaters, x-1)-h)))
return ret