leetcode 烦人的返回值

int** reconstructQueue(int** people, int peopleSize, int* peopleColSize, int* returnSize, int** returnColumnSizes){

    int **returnArr = (int **)malloc(sizeof(int *) * peopleSize);
    *returnColumnSizes = (int *)malloc(sizeof(int) * peopleSize);
    int i, j;
    for (i = 0; i < peopleSize; i++) {
        (*returnColumnSizes)[i] = 2;
        returnArr[i] = (int *)malloc(sizeof(int) * 2);
        for (j = 0; j < 2; j++) {
            returnArr[i][j] = people[i][j] + 1;
        }
    }
    *returnSize = peopleSize;
    return returnArr;
}