<awangdev>31. Next Permutation_1.java
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;
    }
private int sample_funcname ( int [ ] var_0 ) {
  int var_3 = var_0 . length - 1 ;
  while ( var_3 > 0 ) {
    if ( var_0 [ var_3 - 1 ] < var_0 [ var_3 ] ) return var_3 - 1 ;
    var_3 -- ;
  }
  return - 1 ;
}
