comefrom: <qiyuangong>654_Maximum_Binary_Tree_1.java
code: public int max(int[] nums, int l, int r) {
          int max_i = l;
          for (int i = l; i < r; i++) {
              if (nums[max_i] < nums[i])
                  max_i = i;
          }
          return max_i;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 ) {
    int var_3 = var_1 ;
    for ( int var_4 = var_1 ;
    var_4 < var_2 ;
    var_4 ++ ) {
      if ( var_0 [ var_3 ] < var_0 [ var_4 ] ) var_3 = var_4 ;
    }
    return var_3 ;
  }
  