comefrom: <qiyuangong>724_Find_Pivot_Index_1.java
code: public int pivotIndex(int[] nums) {
          int totalsum = 0, leftsum = 0;
          for (int i = 0; i < nums.length; i++) totalsum += nums[i];
          for (int i = 0; i < nums.length; i++) {
              if (leftsum == totalsum - leftsum - nums[i]) return i;
              leftsum += nums[i];
          }
          return -1;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    int var_1 = 0 , var_2 = 0 ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) var_1 += var_0 [ var_3 ] ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) {
      if ( var_2 == var_1 - var_2 - var_0 [ var_3 ] ) return var_3 ;
      var_2 += var_0 [ var_3 ] ;
    }
    return - 1 ;
  }
  