zoukankan      html  css  js  c++  java
  • LeetCode_475. Heaters

    475. Heaters

    Easy

    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.
    package leetcode.easy;
    
    public class Heaters {
    	public int findRadius(int[] houses, int[] heaters) {
    		java.util.Arrays.sort(houses);
    		java.util.Arrays.sort(heaters);
    		int result = Integer.MIN_VALUE;
    
    		for (int house : houses) {
    			int index = java.util.Arrays.binarySearch(heaters, house);
    			if (index < 0) {
    				index = -(index + 1);
    			}
    			int dist1 = index - 1 >= 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;
    			int dist2 = index < heaters.length ? heaters[index] - house : Integer.MAX_VALUE;
    			result = Math.max(result, Math.min(dist1, dist2));
    		}
    		return result;
    	}
    
    	@org.junit.Test
    	public void test() {
    		int[] houses1 = { 1, 2, 3 };
    		int[] heaters1 = { 2 };
    		int[] houses2 = { 1, 2, 3, 4 };
    		int[] heaters2 = { 1, 4 };
    		System.out.println(findRadius(houses1, heaters1));
    		System.out.println(findRadius(houses2, heaters2));
    	}
    }
    
  • 相关阅读:
    vue实现简单的点击切换颜色
    Controller层注解详解
    分布式数据库系统的透明性概念
    utf8和utf8mb64的关系
    数据库设计的四个阶段
    IDEA自定义启动图
    编译过程划分
    Linux 之 CentOS 7 安装Tomcat9
    Linux 之 CentOS 7 安装JDK1.8
    Linux 之 CentOS 7安装MySQL5.7
  • 原文地址:https://www.cnblogs.com/denggelin/p/12029457.html
Copyright © 2011-2022 走看看