杨辉三角ii#119

输入: 3
输出: [1,3,3,1]

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* getRow(int rowIndex, int* returnSize) {

    int ** c =  NULL;
    c=(int**)malloc(sizeof(int*)*(rowIndex+1));
    *returnSize = (int)malloc(sizeof(int)*(rowIndex+1));

    for (int i = 0 ; i < rowIndex+1;i++) {
        
        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];

            }
        }
    }
      (*returnSize) = rowIndex+1;
    return c[rowIndex];
}

4

 [1,4,6,4,1]