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

    Binary Search My solution:

    Be careful in my binary search function, l, r may go out of the range of the array

     1 public class Solution {
     2     public int findRadius(int[] houses, int[] heaters) {
     3         Arrays.sort(heaters);
     4         int minRange = Integer.MIN_VALUE;
     5         for (int house : houses) {
     6             int range = binarySearch(house, heaters);
     7             minRange = Math.max(minRange, range);
     8         }
     9         return minRange;
    10     }
    11     
    12     public int binarySearch(int house, int[] heaters) {
    13         int l=0, r=heaters.length-1;
    14         while (l <= r) {
    15             int m = (r-l)/2 + l;
    16             if (heaters[m] == house) return 0;
    17             else if (heaters[m] < house) l = m + 1;
    18             else r = m - 1;
    19         }
    20         if (l >= heaters.length) return Math.abs(heaters[r]-house);
    21         else if (r < 0) return Math.abs(heaters[l]-house);
    22         return Math.abs(heaters[r]-house)<Math.abs(heaters[l]-house)? Math.abs(heaters[r]-house) : Math.abs(heaters[l]-house);
    23     }
    24 }

    Solution with the highest vote:

     1 public class Solution {
     2     public int findRadius(int[] houses, int[] heaters) {
     3         Arrays.sort(heaters);
     4         int result = Integer.MIN_VALUE;
     5         
     6         for (int house : houses) {
     7             int index = Arrays.binarySearch(heaters, house); // if put each house in heaters array, this is each house's insertion position
     8             if (index < 0) {
     9                 index = -(index + 1);
    10             }
    11             int dist1 = index - 1 >= 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;   //this house's distance with heaters infront of it, maybe none in front
    12             int dist2 = index < heaters.length ? heaters[index] - house : Integer.MAX_VALUE; //this house's distance with heaters after it
    13             
    14             result = Math.max(result, Math.min(dist1, dist2));
    15         }
    16         
    17         return result;
    18     }
    19 }
  • 相关阅读:
    大白话解说,半分钟就懂 --- 分布式与集群是什么 ? 区别是什么?
    intellij idea中去除@Autowired注入对象的红色波浪线提示
    用JQuery获取事件源怎么写
    springBoot 配置url 访问图片
    地图服务 纬度、经度对应坐标轴x,y
    5个问题带你了解export和import的使用以及export和export defalut 的区别
    5个你可能不知道的html5语义化标签
    CSS选择器[attribute | = value] 和 [attribute ^ = value]的区别
    前端ps实用小技巧
    7步教你使用git命令上传本地代码至github仓库(小白向)
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/6197086.html
Copyright © 2011-2022 走看看