475. Heaters
来源:互联网 发布:键位修改软件 编辑:程序博客网 时间:2024/05/18 22:40
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.
思路:每个house要么由它左边的heater加热,要么由它右边的heater加热,两次遍历就好了
Binary Search 也是一种方法
public class Solution { public int findRadius(int[] houses, int[] heaters) { int[] r = new int[houses.length]; int rst = 0; Arrays.fill(r, Integer.MAX_VALUE); Arrays.sort(houses); Arrays.sort(heaters); // heater in charge of house to its left int p = 0; for(int i=0; i<houses.length; i++) { while(p < heaters.length && houses[i] > heaters[p])p++; if(p == heaters.length)break; r[i] = Math.min(r[i], heaters[p]-houses[i]); } // heater in charge of house to its right p = heaters.length-1; for(int i=houses.length-1; i>=0; i--) { while(p >= 0 && houses[i] < heaters[p])p--; if(p == -1)break; r[i] = Math.min(r[i], houses[i]-heaters[p]); } for(int i=0; i<houses.length; i++) { rst = Math.max(rst, r[i]); } return rst; }}
0 0
- 475. Heaters
- 475. Heaters*
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- 475. Heaters
- LeetCode 475. Heaters
- LeetCode 475. Heaters
- 【Leetcode】475. Heaters
- 【LeetCode】 475. Heaters
- Leetcode-475. Heaters
- [leetcode]475. Heaters
- [leetcode]475. Heaters
- 开发地址
- 怎么做二手车成交可能性预测
- Java跨平台原理
- Expected resource of type drawable [ResourceType]
- 欢迎使用CSDN-markdown编辑器
- 475. Heaters
- java中的缓存策略
- redis缓存解析
- 算法经典问题总结
- Android 小白 打怪升级学习路线图,晋升高手之路
- Android 自动旋转提示对话框,可用于提示等待
- Nodejs在Linux的部署和配置
- UITableView的Cell复用原理和源码分析
- JQUERY 获取 DIV 宽度与高度(width,padding,margin,border)