forked from Hazrat-Ali9/JavaScript-Problem-Solving
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathheaters.js
More file actions
44 lines (34 loc) · 919 Bytes
/
heaters.js
File metadata and controls
44 lines (34 loc) · 919 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/**
* @param {number[]} houses
* @param {number[]} heaters
* @return {number}
*
* Time complexity: max(O(nlogn), O(mlogn)) - m is the length of houses, n is the length of heaters.
*/
const findRadius = (houses, heaters) => {
heaters.sort((a, b) => a - b);
let result = -Infinity;
for (let house of houses) {
let index = searchInsert(heaters, house);
const dist1 = index > 0 ? house - heaters[index - 1] : Infinity;
const dist2 = index < heaters.length ? heaters[index] - house : Infinity;
result = Math.max(result, Math.min(dist1, dist2));
}
return result;
};
const searchInsert = (nums, target) => {
let lo = 0;
let hi = nums.length - 1;
while (lo <= hi) {
const mid = lo + Math.floor((hi - lo) / 2);
if (nums[mid] === target) {
return mid;
}
if (target < nums[mid]) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return lo;
};