Leetcode475.heaters

最新推荐文章于 2024-09-14 18:52:56 发布

笃定1109

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量116

点赞数

文章标签： leetcode python

本文链接：https://blog.csdn.net/weixin_40378100/article/details/106768828

版权

def findRadius(houses,heaters):
    houses.sort()
    heaters.sort()
    radius = 0
    i = 0
    for house in houses:
        while i <len(heaters) and heaters[i] <house:
            i+=1
        if i==0:
            radius = max(radius,heaters[i]-house)
        elif i==len(heaters):
            return max(radius,houses[-1]-heaters[-1])
        else:
            radius = max(radius,min(heaters[i]-house,house-heaters[i-1]))
    return radius

house = [1,2,3,4,5,6]
heater = [2,3]
print(findRadius(house,heater))