杨辉三角的样式如下:
1
1 1
1 2 1
1 3 3 1
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
打印杨辉三角该怎么实现呢?
(1)创建一个二维数组
(2)利用两个循环,表示行列
(3)确定行列关系:arry[i][j] = arry[i - 1][j - 1] + arry[i - 1][j]
#define _CRT_SECURE_NO_WARNINGS 1
#include
#include
int main()
{
int i, j,n = 10;
int arry[20][20] = {0};
for (i = 1; i <= n ; i++)
{
for (j = 1; j <= i; j++)
{
arry[i][j] = arry[i - 1][j - 1] + arry[i - 1][j];
arry[1][1] = 1;
arry[1][j] = 1;
arry[i][1] = 1;
printf("%3d ", arry[i][j]);
}
printf("\n");
}
system("pause");
return 0;
}
方法2
(1)创建一个一维数组
(2)逆向
#define _CRT_SECURE_NO_WARNINGS 1
#include
#include
int main()
{
int i, j,n = 10;
int arry[20] = {0};
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
arry[i] = 1;
arry[j] = arry[j + 1] + arry[j];
printf("%d ",arry[j]);
}
printf("\n");
}
system("pause");
return 0;
}