comefrom: <awangdev>977. Squares of a Sorted Array_1.java
code: public int findPos(int[] A) {
          for (int i = 0; i < A.length; i++) {
              if (A[i] >= 0) return i - 1;
          }
          return 0;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    for ( int var_2 = 0 ;
    var_2 < var_0 . length ;
    var_2 ++ ) {
      if ( var_0 [ var_2 ] >= 0 ) return var_2 - 1 ;
    }
    return 0 ;
  }
  