杨辉三角#118

输入: 5
输出:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
] 实现：

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

            }
        }
    }

    return c;
}

5

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