TheAlgorithms-C/leetcode/src/118.c

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
int** generate(int numRows, int* returnSize, int** returnColumnSizes){
    *returnSize = numRows;
    int **ans = (int**)malloc(numRows*sizeof(int*));
    *returnColumnSizes = (int*)malloc(numRows*sizeof(int)); 
   
   for (int i=0; i<numRows; i++) {
        (*returnColumnSizes)[i] = i + 1;
        ans[i] = (int*)malloc((i+1)*sizeof(int));
    }
    
    ans[0][0] = 1;
    
    for (int i=1; i<numRows; i++) {
        ans[i][0] = 1;
        for (int j=1; j<i; j++) {
            ans[i][j] = ans[i-1][j-1] + ans[i-1][j];
        }
        ans[i][i] = 1;
    }
    return ans;
}