leetcode 118 杨辉三角 C语言

题目

leetcode 118

代码

int** generate(int numRows, int* returnSize, int** returnColumnSizes){
    *returnSize = 0;
    int **res = (int **)malloc(sizeof(int *) * numRows);
    (*returnColumnSizes) = (int *)malloc(sizeof(int) * numRows);
    for (int i = 0; i < numRows; i++) {
        res[*returnSize] = (int *)malloc(sizeof(int) * (i + 1));
        res[*returnSize][0] = 1;
        int k = i - 1;
        for (int j = 1; j < i; j++) {
            res[*returnSize][j] = res[k][j - 1] + res[k][j];
        }
        res[*returnSize][i] = 1;
        (*returnColumnSizes)[*returnSize] = i + 1;
        (*returnSize)++;
    }
    return res;
}