Leetcode Problem 475. Heaters

475. Heaters

Leetcode Solutions

Sort the houses and heaters arrays.
Initialize maxRadius to 0.
For each house in houses, perform a binary search on heaters to find the closest heater.
Calculate the distance to the closest heater on the left and the right.
The minimum of these two distances is the minimum radius needed for the current house.
Update maxRadius with the maximum of maxRadius and the minimum radius for the current house.
After processing all houses, return maxRadius as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen