comefrom: <awangdev>31. Next Permutation_1.java
code: private int findLow(int[] nums) {
  
          int end = nums.length - 1;
          while (end > 0) {
              if (nums[end - 1] < nums[end]) return end - 1;
              end--;
          }
          return -1;
      }
masked: private int sample_funcname ( int [ ] var_0 ) {
    int var_1 = var_0 . length - 1 ;
    while ( var_1 > 0 ) {
      if ( var_0 [ var_1 - 1 ] < var_0 [ var_1 ] ) return var_1 - 1 ;
      var_1 -- ;
    }
    return - 1 ;
  }
  