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));
    	}
    }
    
  • 相关阅读:
    asp.net core 不依赖autofac实现aop
    C# 获取调用者信息
    IIS 命令学习
    Jenkins + PowerShell + .net core 自动打包
    gogs 自定义配置
    搜索文件内容神器:SearchMyFiles
    非常强大的磁盘计算大小工具:TreeSizeFree
    rancher入门教程
    IQueryable 表达式解析学习
    Sql server 入门权威指南
  • 原文地址:https://www.cnblogs.com/denggelin/p/12029457.html
Copyright © 2011-2022 走看看