Pascal's Triangole 2 Compact solution in C
int* getRow(int rowIndex, int* returnSize){
    *returnSize=rowIndex+1;
    int **r=(int**)malloc((rowIndex+1)*sizeof(int*));
    for(int i=0;i<=rowIndex;i++){
        r[i]=(int*)malloc((i+1)*sizeof(int));
        r[i][0]=1;r[i][i]=1;
        for(int j=1;j<i;j++)
            r[i][j]=r[i-1][j-1]+r[i-1][j];
    }
    return r[rowIndex];
}
Comments (1)