题解 | #杨辉三角#
杨辉三角
https://www.nowcoder.com/practice/e671c6a913d448318a49be87850adbcc
#include<stdio.h>
int main()
{
int input;
scanf("%d",&input);
int arr[30][30] = { 0 };
arr[0][0] = 1;
for (int i = 1; i <= input; i++)
{
for (int j = 1; j <= i; j++)
{
arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
}
for (int j = 1; j <= i; j++)
{
printf("%5d", arr[i][j]);
}
printf("\n");
}
return 0;
}
投递美团等公司7个岗位 >