Every day a leetcode
题目来源:118. 杨辉三角
解法1:数学
如上图所示,将杨辉三角转化成一个二位数组,每一行的开头和末尾初始化为1,得到计算公式。
代码:
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
int** generate(int numRows, int* returnSize, int** returnColumnSizes){
*returnSize=numRows;
*returnColumnSizes=malloc(numRows*sizeof(int));
int** ans=malloc(numRows*sizeof(int*));
//初始化ans
for(int i=0;i<numRows;i++)
{
(*returnColumnSizes)[i]=i+1;
ans[i]=malloc((i+1)*sizeof(int));
ans[i][0]=ans[i][i]=1;
}
//计算
for(int i=0;i<numRows;i++)
{
for(int j=1;j<i;j++)
{
ans[i][j]=ans[i-1][j-1]+ans[i-1][j];
}
}
return ans;
}
结果: