Pascal's Triangle

Given numRows, generate the first numRows of Pascal’s triangle.

For example, given numRows = 5,
Return

[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]

int** generate(int numRows, int** columnSizes, int* returnSize) {

*returnSize = numRows;

int** returnNums = (int**)malloc(sizeof(int*)*(*returnSize));
*columnSizes = (int*)malloc(sizeof(int)*(*returnSize));
for (int i = 0; i < *returnSize; i++)
{
    returnNums[i] = (int*)malloc(sizeof(int)*(i+1));
    (*columnSizes)[i] = i+1;
}

for (int i = 0; i < *returnSize; i++)
{
    for (int j = 0; j <= i; j++)
    {
        if (j == 0 || j == i)
        {
            returnNums[i][j] = 1;
        }
        else
        {
            returnNums[i][j] = returnNums[i-1][j-1] + returnNums[i-1][j];
        }
    }
}

return returnNums;

}