[leetcode]475. Heaters

最新推荐文章于 2020-08-10 11:20:20 发布

你看见我的代码了么

最新推荐文章于 2020-08-10 11:20:20 发布

阅读量127

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_32135877/article/details/80830500

版权

LeetCode 专栏收录该内容

336 篇文章 0 订阅

订阅专栏

[leetcode]475. Heaters

Analysis

ummmm~—— [ummmm~]

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.
分别对两个数组进行排序，然后寻找距离每个house最近的加热器，不断更新结果就行了。

Implement

class Solution {
public:
    int findRadius(vector<int>& houses, vector<int>& heaters) {
        sort(houses.begin(), houses.end());
        sort(heaters.begin(), heaters.end());
        int len1 = houses.size();
        int len2 = heaters.size();
        int j=0;
        int res = 0;
        for(int i=0; i<len1; i++){
            while(j<len2-1 && (abs(houses[i]-heaters[j])>=abs(houses[i]-heaters[j+1])))
                j++;
            res = max(res, abs(houses[i]-heaters[j]));
        }
        return res;
    }
};