475. Heaters

  1. Heaters
    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 2 standard, then all the houses can be warmed.

分析:先将所有的房子和加热器按照先后顺序排好,因为如果一个房子已经确定了离他最近的加热器,那么他后面的房子离它最近的加热器肯定在这个及这个的后面加热器。

int findRadius(vector<int>& houses, vector<int>& heaters) {
        sort(houses.begin(),houses.end());
        sort(heaters.begin(),heaters.end());
        int i,j,m=houses.size(),n=heaters.size();
        if(!m||!n) return 0;
        int r=0,idx=0;
        for(i=0;i<m;i++)
        {
            int tr=abs(heaters[idx]-houses[i]);
            for(j=idx+1;j<n;j++)
            {
                if(abs(heaters[j]-houses[i])<=tr)
                {
                    tr=abs(heaters[j]-houses[i]);
                    idx=j;
                }
                else 
                break;
            }
            r=max(r,tr);
        }
        return r;
    }
  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值