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_2 = Integer . MIN_VALUE ;
    for ( int var_3 : var_0 ) {
      int var_4 = Arrays . binarySearch ( var_1 , var_3 ) ;
      if ( var_4 < 0 ) var_4 = - ( var_4 + 1 ) ;
      int var_5 = var_4 - 1 >= 0 ? var_3 - var_1 [ var_4 - 1 ] : Integer . MAX_VALUE ;
      int var_6 = var_4 < var_1 . length ? var_1 [ var_4 ] - var_3 : Integer . MAX_VALUE ;
      var_2 = Math . max ( var_2 , Math . min ( var_5 , var_6 ) ) ;
    }
    return var_2 ;
  }
  