leetcode 475. 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:
Numbers of houses and heaters you are given are non-negative and will not exceed 25000.
Positions of houses and heaters you are given are non-negative and will not exceed 10^9.
As long as a house is in the heaters’ warm radius range, it can be warmed.
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

本题题意很简单最笨的方法就是r从1开始逐步递增，不过这样可能超时，这其实是一个寻找最近邻的问题，分别求解一个house距离heater左边和右边的最近的距离，然后选择二者中的min，最后根据这个距离数组求最大值来确定半径距离

本体其实很简单，就是一个遍历问题，问题的关键是想到求解左近邻和右近邻的思路

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <cmath>

using namespace std;

class Solution 
{
public:
    int findRadius(vector<int>& hou, vector<int>& hea)
    {
        sort(hou.begin(),hou.end());
        sort(hea.begin(),hea.end());
        vector<int> right(hou.size(), INT_MAX);
        int i = 0, j = 0;
        while (i < hou.size() && j < hea.size())
        {
            if (hou[i] <= hea[j])
            {
                right[i] = hea[j] - hou[i];
                i++;
            }
            else
                j++;
        }

        i = hou.size() - 1, j = hea.size() - 1;
        vector<int> left(hou.size(), INT_MAX);
        while (i >=0 && j >= 0)
        {
            if (hou[i] >= hea[j])
            {
                left[i] = hou[i] - hea[j];
                i--;
            }
            else
                j--;
        }

        vector<int> res(hou.size(), 0);
        for (int i = 0; i < res.size(); i++)
            res[i] = min(left[i],right[i]);

        return *max_element(res.begin(),res.end());
    }
};