供暖器

/*
 * Problem Statement:
 * Given two arrays, houses and heaters, find the minimum radius required to ensure all houses can be heated by the heaters.
 * The radius is the distance from a heater that a house must be within to be considered heated.
 * 
 * Approach using Java Streams:
 * 1. Sort both houses and heaters arrays.
 * 2. For each house, find the nearest heater using streams to map distances.
 * 3. The maximum of these minimum distances will be the required radius.
 */
 
import java.util.Arrays;
 
public class SolutionStream {
    public int findRadius(int[] houses, int[] heaters) {
        Arrays.sort(houses);
        Arrays.sort(heaters);
        return Arrays.stream(houses)
                .map(house -> {
                    int left = 0, right = heaters.length - 1;
                    int closestHeaterDistance = Integer.MAX_VALUE;
                    while (left <= right) {
                        int mid = left + (right - left) / 2;
                        if (heaters[mid] < house) {
                            left = mid + 1;
                        } else {
                            right = mid - 1;
                        }
                    }
                    if (right >= 0) {
                        closestHeaterDistance = Math.min(closestHeaterDistance, house - heaters[right]);
                    }
                    if (left < heaters.length) {
                        closestHeaterDistance = Math.min(closestHeaterDistance, heaters[left] - house);
                    }
                    return closestHeaterDistance;
                })
                .max()
                .orElse(0);
    }
}