【leetcode】按奇偶排序数组 II

int* sortArrayByParityII(int* A, int ASize, int* returnSize){
    int* arr = (int*)calloc(ASize,sizeof(int));
    int evenindex = 0;
    int oddindex = 1;
    for (int i=0; i<ASize; i++)
    {
        if (A[i] % 2)
        {
            arr[oddindex] = A[i];
            oddindex+=2;
        }
        else
        {
            arr[evenindex] = A[i];
            evenindex+=2;
        }
    }
    *returnSize = ASize;
    return arr;
}