Runtime: 62 ms (Top 96.61%) | Memory: 25.4 MB (Top 58.20%)

Author: AnasImloul

scripts/algorithms/H/Heaters/Heaters.cpp

@@ -1,7 +1,8 @@
+// Runtime: 62 ms (Top 96.61%) | Memory: 25.4 MB (Top 58.20%)
 class Solution {
 public:
     //we will assign each house to its closest heater in position(by taking the minimum
-    //of the distance between the two closest heaters to the house) and then store the maximum 
+    //of the distance between the two closest heaters to the house) and then store the maximum
     //of these differences(since we want to have the same standard radius)
     int findRadius(vector<int>& houses, vector<int>& heaters) {
         sort(heaters.begin(),heaters.end());
@@ -13,7 +14,7 @@ class Solution {
             if(index==heaters.size()){
                 index--;
             }
-            //the two closest positions to house will be heaters[index] and 
+            //the two closest positions to house will be heaters[index] and
             //heaters[index-1]
             int leftDiff=(index-1>=0)?abs(house-heaters[index-1]):INT_MAX;
             int rightDiff=abs(house-heaters[index]);