一维的快速傅里叶变换。输入2n次方数组。输出变换后的系数数组。非递归实现-One-dimensional Fast Fourier Transform. Enter 2n th array. Transformed coefficients output array. Non-recursive implementation