comefrom: <awangdev>IndexMatch_1.java
code: public int indexMatch(int[] nums) {
          if (nums == null || nums.length == 0) {
              return -1;
          }
          
          int start = 0;
          int end = nums.length - 1;
          while (start + 1 < end) {
              int mid = start + (end - start)/2;
              if (nums[mid] == mid) {
                  return mid;
              } else if (nums[mid] < mid) {
                  start = mid;
              } else {
                  end = mid;
              }
          }
          
          return -1;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return - 1 ;
    }
    int var_5 = 0 ;
    int var_6 = var_0 . length - 1 ;
    while ( var_5 + 1 < var_6 ) {
      int var_8 = var_5 + ( var_6 - var_5 ) / 2 ;
      if ( var_0 [ var_8 ] == var_8 ) {
        return var_8 ;
      }
      else if ( var_0 [ var_8 ] < var_8 ) {
        var_5 = var_8 ;
      }
      else {
        var_6 = var_8 ;
      }
    }
    return - 1 ;
  }
  