Leetcode: Heaters

发布时间:2017-3-28 23:48:56 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"Leetcode: Heaters ",主要涉及到Leetcode: Heaters 方面的内容,对于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: 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: [1,2,3,4],[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.

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); 8             if (index < 0) { 9                 index = -(index + 1);10             }11             int dist1 = index - 1 >= 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;12             int dist2 = index < heaters.length ? heaters[index] - house : Integer.MAX_VALUE;13             14             result = Math.max(result, Math.min(dist1, dist2));15         }16         17         return result;18     }19 }

上一篇:ES6 带来了什么
下一篇:java中的volatile和synchronized

相关文章

关键词: Leetcode: Heaters

相关评论

本站评论功能暂时取消,后续此功能例行通知。

一、不得利用本站危害国家安全、泄露国家秘密,不得侵犯国家社会集体的和公民的合法权益,不得利用本站制作、复制和传播不法有害信息!

二、互相尊重,对自己的言论和行为负责。

好贷网好贷款