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

思路:最开始想的是怎么样让每个heater尽可能找到最近的house,但是这种思路不太好,因为一个你不知道这个heater到底会加热都少房子;所以我们换个角度,每个房子必然对应一个heater,我们统计所有房子最近的heater,然后输出最大值就可以了。

最简单的Brute force的求解方法:

class Solution {
public:
	int findRadius(vector<int>& houses, vector<int>& heaters) {
		int ans = 0;
		for (int house : houses) {
			int dis = INT_MAX;
			for (int heater : heaters) {
				dis = min(dis, abs(house - heater));
			}
			ans = max(ans, dis);
		}
		return ans;
	}
};

当然会超时了,我们使用二分查找的方式:

class Solution {
public:
	int findRadius(vector<int>& houses, vector<int>& heaters) {
		int ans = 0;
        sort(heaters.begin(), heaters.end());
		for (int house : houses) {
			int dis = INT_MAX;
			auto it = lower_bound(heaters.begin(), heaters.end(), house);
			if (it == heaters.end()) dis =abs(house - *(it-1));
			else if (it == heaters.begin()) dis = abs(house - *it);
			else dis = min(abs(house - *(it - 1)), abs(house - *it));
			ans = max(ans, dis);
		}
		return ans;
	}
};

成功通过!

发布了526 篇原创文章 · 获赞 42 · 访问量 9万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 技术黑板 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览