群里有同学问杨辉三角的算法,我写了一个,用一维数组做的,感觉这东西,可以不用数组凑出来
果然,哈哈,搞到零点37,睡意全无,代码贴出来,敬请拍砖using System;namespace ConsoleApplication1
{
class Program
{ static void Main(string[] args)
{
Console.WriteLine("请输入杨辉三角的参数(整形):");
int i = Convert.ToInt32(Console.ReadLine());
yanghui yh = new yanghui(i);
yh.printtri();
}
}
public class yanghui
{ private int _i;
public yanghui(int i)
{
_i = i;
}
public void printtri()
{
for (int i = 0; i <_i; i++)
{
show(i);
}
}
public void show(int i)
{
int k=1, l=i;
int m=1;
Console.Write(m+" ");
for (int j = 0; j < i; j++)
{
m = m * l / k;
k++;
l--;
Console.Write(m+" ");
}
Console.WriteLine();
}
}
}
果然,哈哈,搞到零点37,睡意全无,代码贴出来,敬请拍砖using System;namespace ConsoleApplication1
{
class Program
{ static void Main(string[] args)
{
Console.WriteLine("请输入杨辉三角的参数(整形):");
int i = Convert.ToInt32(Console.ReadLine());
yanghui yh = new yanghui(i);
yh.printtri();
}
}
public class yanghui
{ private int _i;
public yanghui(int i)
{
_i = i;
}
public void printtri()
{
for (int i = 0; i <_i; i++)
{
show(i);
}
}
public void show(int i)
{
int k=1, l=i;
int m=1;
Console.Write(m+" ");
for (int j = 0; j < i; j++)
{
m = m * l / k;
k++;
l--;
Console.Write(m+" ");
}
Console.WriteLine();
}
}
}
仿佛看到了当初的我