int* sortArrayByParityII(int* A, int ASize, int* returnSize){
int *ret = (int *)malloc(sizeof(int)* ASize);
int i, j, k;
j = 0;
k = 1;
for(i=0; i<ASize; i++){
if(!(A[i] & 0x1)){
ret[j] = A[i];
j+=2;
}else{
ret[k] = A[i];
k+=2;
}
}
*returnSize = ASize;
return ret;
}
leetcode-922. 按奇偶排序数组 II-C语言
最新推荐文章于 2021-05-18 23:54:09 发布