leetcode475

最新推荐文章于 2021-03-14 20:35:29 发布

基德殿下世界第一帅

最新推荐文章于 2021-03-14 20:35:29 发布

阅读量210

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_36257146/article/details/103573546

版权

leetcode 专栏收录该内容

320 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int findRadius(vector<int>& houses, vector<int>& heaters) {
        int r_ans = 0;
        sort(houses.begin(),houses.end());
        sort(heaters.begin(),heaters.end());
        
        int i = 0;
        for(int house : houses)
        {
            int t = INT_MAX;
            while(i<heaters.size() && house > heaters[i]) i++;
            if(i == 0)
            {
                t = heaters[i] - house;
            }
            else if(i == heaters.size())
            {
                t = house - heaters[i-1];
            }
            else
            {
                t = min(house - heaters[i-1],heaters[i]-house);
            }
            cout<<i<<" "<<t<<endl;
            r_ans = max(r_ans,t);
        }
        return r_ans;
        
    }
};