Every day a leetcode
题目来源:119. 杨辉三角 II
解法1:模拟
代码:
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* getRow(int rowIndex, int* returnSize){
*returnSize=rowIndex+1;
int *ans[rowIndex+1];
for(int i=0;i<=rowIndex;i++)
{
ans[i]=(int*)malloc((i+1)*sizeof(int));
ans[i][0]=ans[i][i]=1;
for(int j=1;j<i;j++) ans[i][j]=ans[i-1][j-1]+ans[i-1][j];
}
return ans[rowIndex];
}
结果: