comefrom: <gouthampradhan>binary_search_HIndexII_1.java
code: public int hIndex(int[] citations) {
      if (citations.length == 0) return 0;
      int s = 0, e = citations.length;
      int ans = -1;
      while (s < e) {
        int m = (s + e) >>> 1;
        int cit = citations.length - m;
        if (citations[m] > cit) {
          if (ans < cit) {
            ans = cit;
          }
          e = m;
        } else {
          if (ans < citations[m]) {
            ans = citations[m];
          }
          s = m + 1;
        }
      }
      return ans;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 . length == 0 ) return 0 ;
    int var_1 = 0 , var_2 = var_0 . length ;
    int var_3 = - 1 ;
    while ( var_1 < var_2 ) {
      int var_4 = ( var_1 + var_2 ) >>> 1 ;
      int var_5 = var_0 . length - var_4 ;
      if ( var_0 [ var_4 ] > var_5 ) {
        if ( var_3 < var_5 ) {
          var_3 = var_5 ;
        }
        var_2 = var_4 ;
      }
      else {
        if ( var_3 < var_0 [ var_4 ] ) {
          var_3 = var_0 [ var_4 ] ;
        }
        var_1 = var_4 + 1 ;
      }
    }
    return var_3 ;
  }
  