杨辉三角的数组实现

定义变量N作为杨辉三角显示的行数，为了方便的计算，申请（N+!）*(N+1)个二维数组内存，首先先确定外边的元素都为1，然后计算元素内部值

#include<iostream>
using namespace std;


void main()
{
int N;
cout << "请输入要输出杨辉三角的行数:";
cin >> N;
N += 1;
int **a = new int *[N];
for (int i = 0; i < N; i++)
a[i] = new int[N];
for (int i = 1; i < N; i++)
{
a[i][1] = 1;
a[i][i] = 1;


}
for (int i = 3; i < N; i++)
{
for (int j = 2; j <= i - 1; j++)
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];


}
for (int i = 1; i < N;i++)
{
for(int j = 1; j <= i; j++)
cout << a[i][j] << " ";
cout << "\n";
}
}