Table of Contents

# Heaters – LeetCode Solution Java , Python 3, Python 2 , C , C++, Best and Optimal Solutions , All you need.

Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses.

Every house can be warmed, as long as the house is within the heater’s warm radius range.

Given the positions of `houses`

and `heaters`

on a horizontal line, return *the minimum radius standard of heaters so that those heaters could cover all houses.*

**Notice** that all the `heaters`

follow your radius standard, and the warm radius will the same.

**Example 1:**

Input:houses = [1,2,3], heaters = [2]Output:1Explanation: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:houses = [1,2,3,4], heaters = [1,4]Output:1Explanation: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.

**Example 3:**

Input:houses = [1,5], heaters = [2]Output:3

**Constraints:**

`1 <= houses.length, heaters.length <= 3 * 10`

^{4}`1 <= houses[i], heaters[i] <= 10`

^{9}

# C++ Heaters LeetCode Solution

```
```Here, `A = houses`

and `H = heaters`

.

```
class Solution {
public:
/*
Example: h = house, * = heater M = INT_MAX
h h h h h h h h h houses
1 2 3 4 5 6 7 8 9 index
* * * heaters
0 2 1 0 1 0 - - - (distance to nearest RHS heater)
0 1 2 0 1 0 1 2 3 (distance to nearest LHS heater)
0 1 1 0 1 0 1 2 3 (res = minimum of above two)
Result is maximum value in res, which is 3.
*/
int findRadius(vector<int>& A, vector<int>& H) {
sort(A.begin(), A.end());
sort(H.begin(), H.end());
vector<int> res(A.size(), INT_MAX);
// For each house, calculate distance to nearest RHS heater
for (int i = 0, h = 0; i < A.size() && h < H.size(); ) {
if (A[i] <= H[h]) { res[i] = H[h] - A[i]; i++; }
else { h++; }
}
// For each house, calculate distance to nearest LHS heater
for (int i = A.size()-1, h = H.size()-1; i >= 0 && h >= 0; ) {
if (A[i] >= H[h]) { res[i] = min(res[i], A[i] - H[h]); i--; }
else { h--; }
}
return *max_element(res.begin(), res.end());
}
};
```

# Java Heaters LeetCode Solution

```
``````
public class Solution {
public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(heaters);
int result = Integer.MIN_VALUE;
for (int house : houses) {
int index = Arrays.binarySearch(heaters, house);
if (index < 0) {
index = -(index + 1);
}
int dist1 = index - 1 >= 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;
int dist2 = index < heaters.length ? heaters[index] - house : Integer.MAX_VALUE;
result = Math.max(result, Math.min(dist1, dist2));
}
return result;
}
}
```

# Python 3 HeatersLeetCode Solution

```
``````
def findRadius(self, houses, heaters):
heaters.sort()
return max(min(abs(house - heater)
for i in [bisect.bisect(heaters, house)]
for heater in heaters[i-(i>0):i+1])
for house in houses)
```

Array-1180

String-562

Hash Table-412

Dynamic Programming-390

Math-368

Sorting-264

Greedy-257

Depth-First Search-256

Database-215

Breadth-First Search-200

Tree-195

Binary Search-191

Matrix-176

Binary Tree-160

Two Pointers-151

Bit Manipulation-140

Stack-133

Heap (Priority Queue)-117

Design-116

Graph-108

Simulation-103

Prefix Sum-96

Backtracking-92

Counting-86

Sliding Window-73

Linked List-69

Union Find-66

Ordered Set-48

Monotonic Stack-47

Recursion-43

Trie-41

Binary Search Tree-40

Divide and Conquer-40

Enumeration-39

Bitmask-37

Queue-33

Memoization-32

Topological Sort-31

Geometry-30

Segment Tree-27

Game Theory-24

Hash Function-24

Binary Indexed Tree-21

Interactive-18

Data Stream-17

String Matching-17

Rolling Hash-17

Shortest Path-16

Number Theory-16

Combinatorics-15

Randomized-12

Monotonic Queue-9

Iterator-9

Merge Sort-9

Concurrency-9

Doubly-Linked List-8

Brainteaser-8

Probability and Statistics-7

Quickselect-7

Bucket Sort-6

Suffix Array-6

Minimum Spanning Tree-5

Counting Sort-5

Shell-4

Line Sweep-4

Reservoir Sampling-4

Eulerian Circuit-3

Radix Sort-3

Strongly Connected Componen-t2

Rejection Sampling-2

Biconnected Component-1