[leetcode] 475. Heaters

[leetcode] 475. Heaters

Description

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.

分析

题目的意思是：给你一个heater数组，让heaters为使所有的房子供暖，求最小的供暖半径。

先对heaters和houses排序，最小半径应该是heaters[j]与heaters[j+1]最大间隔的一半，这里我们需要遍历一次就可以求得。

代码

class Solution {public: int findRadius(vector& houses, vector& heaters) { int res=0; int n=heaters.size(); int j=0; sort(houses.begin(),houses.end()); sort(heaters.begin(),heaters.end()); for(int i=0;i

参考文献

​​[LeetCode] Heaters 加热器​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。