Heaters

本文介绍了一道关于设计供暖系统的算法题,任务是找到供暖设备覆盖所有房屋所需的最小半径。通过输入房屋和供暖设备的位置,使用排序和二分查找的方法来高效求解。给出两个例子说明如何实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

 

 1 public class Solution {
 2     public int findRadius(int[] houses, int[] heaters) {
 3         if (houses.length == 0 || heaters.length == 0) return 0;
 4         
 5         Arrays.sort(heaters);
 6         int n_house = houses.length, n_heaters = heaters.length;
 7         int result = Integer.MIN_VALUE;
 8         
 9         for (int house : houses) {
10             int index = Arrays.binarySearch(heaters, house);
11             if (index < 0) index = -index - 1;
12             
13             int leftDist = index > 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;
14             int rightDist = index < n_heaters? heaters[index] - house : Integer.MAX_VALUE;
15             
16             result = Math.max(result, Math.min(leftDist, rightDist));
17         }
18         return result;
19     }
20 }

 

转载于:https://www.cnblogs.com/amazingzoe/p/6391562.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值