zoukankan      html  css  js  c++  java
  • 475. 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:

    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: [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.
    

    逐个对于house找到离它最近的那个heater,然后更新res。

    class Solution:
        def findRadius(self, houses, heaters):
            """
            :type houses: List[int]
            :type heaters: List[int]
            :rtype: int
            """
            res = 0
            houses.sort()
            heaters.sort()
            i,j = 0,0
            while i<len(houses):
                if j==0 and houses[i]<=heaters[0]:
                    res = max(res,heaters[j]-houses[i])
                    i += 1
                    continue
                if j==len(heaters)-1:
                    res = max(res,houses[i]-heaters[j])
                    i += 1
                    continue
                if heaters[j]<=houses[i] and houses[i]<=heaters[j+1]:
                    res = max(res,min(houses[i]-heaters[j],heaters[j+1]-houses[i]))
                    i += 1
                    continue
                j += 1
            return res
    
  • 相关阅读:
    085_JS Promise
    086_Service Cloud
    081_Introducing trigger handler class
    080_Dataloader.io
    Veeva_001常见问题总结
    UML 组成 1
    078_Sublime HaoIDE 搭建 Lightning Aura环境
    075_解密加密
    074_Wrapper_Class
    073_SFDC Limit
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/10245076.html
Copyright © 2011-2022 走看看