solves heaters

Author: anishLearnsToCode

Diff for: README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-107/571-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-107/1571-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-32/1571-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-108/571-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-108/1571-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-108/1571-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 
 🔒 = Subscription Content
@@ -125,7 +125,7 @@
 | 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RepeatedSubstringPattern.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/repeated_substring_pattern.py) |
 | 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HammingDistance.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/hamming_distance.py) |
 | 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/IslandPerimeter.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/island_perimeter.py) |
-| 475 | [Heaters](https://leetcode.com/problems/heaters) | Medium | |
+| 475 | [Heaters](https://leetcode.com/problems/heaters) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/Heaters.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/heaters.py) |
 | 476 | [Number Complement](https://leetcode.com/problems/number-complement) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberComplement.java) |
 | 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LicenseKeyFormatting.java) |
 | 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MaxConsecutiveOnes.java) |

Diff for: python/heaters.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    def binary_search(self, array: List[int], element: int) -> int:
+        left, right = 0, len(array) - 1
+        while left <= right:
+            middle = (left + right) // 2
+            if array[middle] == element: return middle
+            elif array[middle] < element: left = middle + 1
+            else: right = middle - 1
+        return left
+
+    def findRadius(self, houses: List[int], heaters: List[int]) -> int:
+        heaters.sort()
+        minRadius, infinity = 0, float('inf')
+        for house in houses:
+            index = self.binary_search(heaters, house)
+            if index < len(heaters) and house == heaters[index]:
+                continue
+            leftRadius = infinity if index == 0 else house - heaters[index - 1]
+            rightRadius = infinity if index == len(heaters) else heaters[index] - house
+            minRadius = max(minRadius, min(leftRadius, rightRadius))
+        return minRadius

Diff for: src/Heaters.java

@@ -0,0 +1,33 @@
+import java.util.Arrays;
+
+public class Heaters {
+    private static int binarySearch(int[] array, int element) {
+        int left = 0, right = array.length - 1, middle;
+        while (left <= right) {
+            middle = (left + right) / 2;
+            if (array[middle] == element) return middle;
+            else if (array[middle] < element) left = middle + 1;
+            else right = middle - 1;
+        }
+        return left;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(findRadius(new int[] {1, 2, 3, 4}, new int[] {1, 4}));
+    }
+
+    public static int findRadius(int[] houses, int[] heaters) {
+        Arrays.sort(heaters);
+        int minRadius = 0, leftRadius, rightRadius;
+        for (int house : houses) {
+            int index = binarySearch(heaters, house);
+            if (index < heaters.length && house == heaters[index]) {
+                continue;
+            }
+            leftRadius = index > 0 ? house - heaters[index - 1] : Integer.MAX_VALUE;
+            rightRadius = (index == heaters.length ? Integer.MAX_VALUE : heaters[index] - house);
+            minRadius = Math.max(minRadius, Math.min(leftRadius, rightRadius));
+        }
+        return minRadius;
+    }
+}