主题:不求最快但求最简(打印杨辉三角)
static void printYanghui(int n)
{
int[,] a = new int[n, n];
for (int k = 0; k < n;k++ )
{
Console.Out.Write(" ");
}
Console.Out.WriteLine("1" + " ");
for (int i = 1; i < n;i++ )
{
a[i, 0] = a[i, i] = 1;
for (int m = 0; m < n-i;m++ )
{
Console.Out.Write(" ");
}
Console.Out.Write(a[i,0]+" ");
for (int j = 1; j < i;j++ )
{
a[i,j]=a[i-1,j-1]+a[i-1,j];
Console.Out.Write(a[i,j]+" ");
}
Console.Out.WriteLine(a[i,i]+" ");
}
}
{
int[,] a = new int[n, n];
for (int k = 0; k < n;k++ )
{
Console.Out.Write(" ");
}
Console.Out.WriteLine("1" + " ");
for (int i = 1; i < n;i++ )
{
a[i, 0] = a[i, i] = 1;
for (int m = 0; m < n-i;m++ )
{
Console.Out.Write(" ");
}
Console.Out.Write(a[i,0]+" ");
for (int j = 1; j < i;j++ )
{
a[i,j]=a[i-1,j-1]+a[i-1,j];
Console.Out.Write(a[i,j]+" ");
}
Console.Out.WriteLine(a[i,i]+" ");
}
}