杨辉三角特点:第一列全为1,行列号相同全为1,某个元素是其上一行同一列元素和前一列元素之和,建立二维数组依据特点建立约束条件即可打印
//在屏幕上打印任意行杨辉三角。
//1
//1 1
//1 2 1
//1 3 3 1
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void yanghui_triangle(int n, int a[100][100]) {
int i = 0, j = 0;
for (i = 0; i < n; i++) {
for (j = 0; j <= i; j++) {
if (i == j || j == 0) {
a[i][j] = 1;
}
else {
a[i][j] = a[i - 1][j] + a[i - 1][j - 1];
}
printf("%d\t", a[i][j]);
}
printf("\n");
}
}
int main() {
int n = 0;
int a[100][100] = { 0 };
printf("你想打印多少行的杨辉三角\n");
scanf("%d", &n);
yanghui_triangle(n,a);
system("pause");
return 0;
}