杨辉三角序列的生成

void Pascal(int n)
{

if (n == 0)
    return;
int** num = (int**)malloc(sizeof(int*)*n);
for (int i = 0; i < n; i++)
    num[i] = (int*)malloc(sizeof(int)*n);

for (int i = 0; i < n; i++)
{
    for (int j = 0; j < i+1; j++)
    {
        if (j == 0 || j == i)
            num[i][j] = 1;
        else
            num[i][j] = num[i-1][j-1]+num[i-1][j];
    }
}

for (int i = 0; i < n; i++)
{
    for (int j = 0; j < i+1; j++)
        printf("%d ", num[i][j]);
}
printf("\n");

for (int i = 0; i < n; i++)
    free(num[i]);
free(num);

}