<qiyuangong>238_Product_of_Array_Except_Self_1.java
public int[] productExceptSelf(int[] nums) {
        int n = nums.length;
        int[] res = new int[n];
        res[0] = 1;
        for (int i = 1; i < n; i++) {
            res[i] = res[i - 1] * nums[i - 1];
        }
        int right = 1;
        for (int i = n - 1; i >= 0; i--) {
            res[i] *= right;
            right *= nums[i];
        }
        return res;
    }
public int [ ] sample_funcname ( int [ ] var_0 ) {
  int var_2 = var_0 . length ;
  int [ ] var_3 = new int [ var_2 ] ;
  var_3 [ 0 ] = 1 ;
  for ( int var_6 = 1 ;
  var_6 < var_2 ;
  var_6 ++ ) {
    var_3 [ var_6 ] = var_3 [ var_6 - 1 ] * var_0 [ var_6 - 1 ] ;
  }
  int var_7 = 1 ;
  for ( int var_6 = var_2 - 1 ;
  var_6 >= 0 ;
  var_6 -- ) {
    var_3 [ var_6 ] *= var_7 ;
    var_7 *= var_0 [ var_6 ] ;
  }
  return var_3 ;
}
