力扣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; 
    *returnColumnSizes=(int*)malloc(sizeof(int)*numRows);
    int **ans=(int**)malloc(numRows*sizeof(int*));
    for(int i=0;i<numRows;i++){
        *(ans+i)=(int*)malloc(sizeof(int)*(i+1));
        (*returnColumnSizes)[i]=i+1;
        ans[i][0]=ans[i][i]=1;
        if(i==0||i==1)continue;
        for(int j=0;j<i-1;j++)
            ans[i][j+1]=ans[i-1][j]+ans[i-1][j+1];
    }
    return ans;

}