【Leetcode】C语言 118. Pascal‘s Triangle

杨辉三角，主要在int[i][j]=int[i-1[j-1]+int[i][j-1]。

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