comefrom: <qiyuangong>1304_Find_N_Unique_Integers_Sum_up_to_Zero_1.java
code: public int[] sumZero(int n) {
          int[] res = new int[n];
          for (int i = 1; i < n; i++) {
              res[i] = i;
              res[0] -= i;
          }
          return res;
      }
masked: public int [ ] sample_funcname ( int var_0 ) {
    int [ ] var_1 = new int [ var_0 ] ;
    for ( int var_2 = 1 ;
    var_2 < var_0 ;
    var_2 ++ ) {
      var_1 [ var_2 ] = var_2 ;
      var_1 [ 0 ] -= var_2 ;
    }
    return var_1 ;
  }
  