这个leetcode上的第119题,我这哪里错了啊。
int* getRow(int rowIndex, int* returnSize) {
int i, j;
int** patriangle = (int**)malloc(sizeof(int*) * rowIndex);
int* colsize = (int*)malloc(sizeof(int) * (rowIndex + 1));
//将杨辉三角构造到所对应的行数
for (i = 0; i <= rowIndex; i++)
{
patriangle[i] = (int*)malloc(sizeof(int) * (i + 1));
colsize[i] = i + 1;
patriangle[i][0] = 1;
patriangle[i][i] = 1;
//从第3行开始构造
if (i >= 2)
{
for (j = 1; j < i; j++)
{
patriangle[i][j] = patriangle[i - 1][j - 1] + patriangle[i - 1][j];
}
}
}
*returnSize = colsize[rowIndex];
return patriangle[rowIndex];
}