leetcode2sumc-leetcode-1304-Find-N-Unique-Integers-Sum-up-to-Zer...

leetcode 2 和 c leetcode 1304 - 找到 N 个唯一整数总和为零 C＃ public int [] SumZero ( int n ) { var arr = new int [ n ]; int j = 0 ; int x = 1 ; for ( int i = 0 ; i < n / 2 ; i ++ ) { arr [ j ++ ] = x ; arr [ j ++ ] = - 1 * x ; x ++ ; } if ( n % 2 == 1 ) arr [ j ] = 0 ; return arr ; }