//杨辉三角形
//1
//1 1
//1 2 1
//1 3 3 1
//1 4 6 4 1
static void Math5()
{
int[][] arr = new int[5][];
for (int i = 0; i < arr.Length; i++)
{
arr[i] = new int[i+1];
for (int j = 0; j < arr[i].Length; j++)
{
if (j == 0||j == i)
{
arr[i][j] = 1;
}
else
{
arr[i][j] = arr[i - 1][j] + arr[i][j - 1];
}
Console.Write(arr[i][j]+" ");
}
Console.Write("\n");
}
}
//1
//1 1
//1 2 1
//1 3 3 1
//1 4 6 4 1
static void Math5()
{
int[][] arr = new int[5][];
for (int i = 0; i < arr.Length; i++)
{
arr[i] = new int[i+1];
for (int j = 0; j < arr[i].Length; j++)
{
if (j == 0||j == i)
{
arr[i][j] = 1;
}
else
{
arr[i][j] = arr[i - 1][j] + arr[i][j - 1];
}
Console.Write(arr[i][j]+" ");
}
Console.Write("\n");
}
}