一个算法，将A[0…n-1]中所有奇数一道偶数之前。要求不另增加存储空间，且时间复杂度为O(n)-An algorithm, A [0 ... n-1] even before all the odd one. Asked not to be another increase in storage space, and the time complexity is O (n)