comefrom: <qiyuangong>475_Heaters_1.java
code: 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;
      }
masked: public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
    Arrays . sort ( var_1 ) ;
    int var_6 = Integer . MIN_VALUE ;
    for ( int var_7 : var_0 ) {
      int var_9 = Arrays . binarySearch ( var_1 , var_7 ) ;
      if ( var_9 < 0 ) var_9 = - ( var_9 + 1 ) ;
      int var_13 = var_9 - 1 >= 0 ? var_7 - var_1 [ var_9 - 1 ] : Integer . MAX_VALUE ;
      int var_15 = var_9 < var_1 . length ? var_1 [ var_9 ] - var_7 : Integer . MAX_VALUE ;
      var_6 = Math . max ( var_6 , Math . min ( var_13 , var_15 ) ) ;
    }
    return var_6 ;
  }
  